Encoder, decoder, encoding method, and decoding method

ABSTRACT

An encoder includes circuitry and memory coupled to the circuitry. The circuitry, in operation, for each coefficient of a plurality of coefficients included in a block, determines a base level relating to Context-Based Adaptive Binary Arithmetic Coding (CABAC) for the coefficient, and encodes an absolute value of the coefficient. In determining the base level, when one or more flags are used in encoding the absolute value of the coefficient, the base level is determined to be a first value, and when one or more flags are not used in the encoding, the base level is determined to be a second value that is smaller than the first value. In encoding the absolute value of the coefficient, when one or more flags are not used, a rice parameter is determined based on the base level which is equal to the second value, and the coefficient is binarized using the rice parameter.

CROSS REFERENCE TO RELATED APPLICATIONS

This is a continuation application of U.S. patent application Ser. No. 17/173,024 filed on Feb. 10, 2021, which is a continuation application of PCT International Application No. PCT/JP2019/037618 filed on Sep. 25, 2019, which claims priority to U.S. Provisional Patent Application No. 62/738,399 filed on Sep. 28, 2018. The entire disclosures of the above-identified applications, including the specifications, drawings and claims are incorporated herein by reference in their entirety.

BACKGROUND Technical Field

This disclosure relates to video coding, and particularly to video encoding and decoding systems, components, and methods.

Description of the Related Art

With advancement in video coding technology, from H.261 and MPEG-1 to H.264/AVC (Advanced Video Coding), MPEG-LA, H.265/HEVC (High Efficiency Video Coding) and H.266/VVC (Versatile Video Codec), there remains a constant need to provide improvements and optimizations to the video coding technology to process an ever-increasing amount of digital video data in various applications.

It should be noted that Non Patent Literature (NPL) 1 relates to one example of the conventional standard related to the above-described video coding technique.

CITATION LIST Non Patent Literature

[NPL 1] H.265 (ISO/IEC 23008-2 HEVC)/HEVC (High Efficiency Video Coding)

BRIEF SUMMARY

For example, an encoder according to an aspect of the present disclosure includes circuitry; and memory coupled to the circuitry. In the encoder, the circuitry, in operation, encodes, for each of a plurality of coefficients, an absolute value of the coefficient in predetermined order, the plurality of coefficients being included in a structural unit of an image which has been transformed and quantized, and encodes, for each of the plurality of coefficients, a sign indicating whether the coefficient is positive or negative, in encoding the absolute value, a signal indicating parity that is a least significant bit of the absolute value is encoded, whether to use a flag in encoding a portion of the absolute value other than the least significant bit is determined based on a first condition and a second condition, and the flag is encoded by context-based adaptive binary arithmetic coding (CABAC) involving updating a symbol occurrence probability when it is determined that the flag is to be used, the first condition is based on a magnitude of the absolute value, and the second condition is for limiting a total number of flags used in the structural unit.

Some implementations of embodiments of the present disclosure may improve an encoding efficiency, may simply be an encoding/decoding process, may accelerate an encoding/decoding process speed, may efficiently select appropriate components/operations used in encoding and decoding such as appropriate filter, block size, motion vector, reference picture, reference block, etc.

Additional benefits and advantages of one aspect of the present disclosure will become apparent from the specification and drawings. The benefits and/or advantages may be individually obtained by the various embodiments and features of the specification and drawings, not all of which need to be provided in order to obtain one or more of such benefits and/or advantages.

It should be noted that general or specific embodiments may be implemented as a system, a method, an integrated circuit, a computer program, a storage medium, or any selective combination thereof.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

These and other advantages and features will become apparent from the following description thereof taken in conjunction with the accompanying Drawings, by way of non-limiting examples of embodiments disclosed herein.

FIG. 1 is a block diagram illustrating a functional configuration of an encoder according to an embodiment.

FIG. 2 is a flow chart indicating one example of an overall encoding process performed by the encoder.

FIG. 3 is a conceptual diagram illustrating one example of block splitting.

FIG. 4A is a conceptual diagram illustrating one example of a slice configuration.

FIG. 4B is a conceptual diagram illustrating one example of a tile configuration.

FIG. 5A is a chart indicating transform basis functions for various transform types.

FIG. 5B is a conceptual diagram illustrating example spatially varying transforms (SVT).

FIG. 6A is a conceptual diagram illustrating one example of a filter shape used in an adaptive loop filter (ALF).

FIG. 6B is a conceptual diagram illustrating another example of a filter shape used in an ALF.

FIG. 6C is a conceptual diagram illustrating another example of a filter shape used in an ALF.

FIG. 7 is a block diagram indicating one example of a specific configuration of a loop filter which functions as a deblocking filter (DBF).

FIG. 8 is a conceptual diagram indicating an example of a deblocking filter having a symmetrical filtering characteristic with respect to a block boundary.

FIG. 9 is a conceptual diagram for illustrating a block boundary on which a deblocking filter process is performed.

FIG. 10 is a conceptual diagram indicating examples of Bs values.

FIG. 11 is a flow chart illustrating one example of a process performed by a prediction processor of the encoder.

FIG. 12 is a flow chart illustrating another example of a process performed by the prediction processor of the encoder.

FIG. 13 is a flow chart illustrating another example of a process performed by the prediction processor of the encoder.

FIG. 14 is a conceptual diagram illustrating sixty-seven intra prediction modes used in intra prediction in an embodiment.

FIG. 15 is a flow chart illustrating an example basic processing flow of inter prediction.

FIG. 16 is a flow chart illustrating one example of derivation of motion vectors.

FIG. 17 is a flow chart illustrating another example of derivation of motion vectors.

FIG. 18 is a flow chart illustrating another example of derivation of motion vectors.

FIG. 19 is a flow chart illustrating an example of inter prediction in normal inter mode.

FIG. 20 is a flow chart illustrating an example of inter prediction in merge mode.

FIG. 21 is a conceptual diagram for illustrating one example of a motion vector derivation process in merge mode.

FIG. 22 is a flow chart illustrating one example of frame rate up conversion (FRUC) process.

FIG. 23 is a conceptual diagram for illustrating one example of pattern matching (bilateral matching) between two blocks along a motion trajectory.

FIG. 24 is a conceptual diagram for illustrating one example of pattern matching (template matching) between a template in a current picture and a block in a reference picture.

FIG. 25A is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block based on motion vectors of a plurality of neighboring blocks.

FIG. 25B is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block in affine mode in which three control points are used.

FIG. 26A is a conceptual diagram for illustrating an affine merge mode.

FIG. 26B is a conceptual diagram for illustrating an affine merge mode in which two control points are used.

FIG. 26C is a conceptual diagram for illustrating an affine merge mode in which three control points are used.

FIG. 27 is a flow chart illustrating one example of a process in affine merge mode.

FIG. 28A is a conceptual diagram for illustrating an affine inter mode in which two control points are used.

FIG. 28B is a conceptual diagram for illustrating an affine inter mode in which three control points are used.

FIG. 29 is a flow chart illustrating one example of a process in affine inter mode.

FIG. 30A is a conceptual diagram for illustrating an affine inter mode in which a current block has three control points and a neighboring block has two control points.

FIG. 30B is a conceptual diagram for illustrating an affine inter mode in which a current block has two control points and a neighboring block has three control points.

FIG. 31A is a flow chart illustrating a merge mode process including decoder motion vector refinement (DMVR).

FIG. 31B is a conceptual diagram for illustrating one example of a DMVR process.

FIG. 32 is a flow chart illustrating one example of generation of a prediction image.

FIG. 33 is a flow chart illustrating another example of generation of a prediction image.

FIG. 34 is a flow chart illustrating another example of generation of a prediction image.

FIG. 35 is a flow chart illustrating one example of a prediction image correction process performed by an overlapped block motion compensation (OBMC) process.

FIG. 36 is a conceptual diagram for illustrating one example of a prediction image correction process performed by an OBMC process.

FIG. 37 is a conceptual diagram for illustrating generation of two triangular prediction images.

FIG. 38 is a conceptual diagram for illustrating a model assuming uniform linear motion.

FIG. 39 is a conceptual diagram for illustrating one example of a prediction image generation method using a luminance correction process performed by a local illumination compensation (LIC) process.

FIG. 40 is a block diagram illustrating a mounting example of the encoder.

FIG. 41 is a block diagram illustrating a functional configuration of a decoder according to an embodiment.

FIG. 42 is a flow chart illustrating one example of an overall decoding process performed by the decoder.

FIG. 43 is a flow chart illustrating one example of a process performed by a prediction processor of the decoder.

FIG. 44 is a flow chart illustrating another example of a process performed by the prediction processor of the decoder.

FIG. 45 is a flow chart illustrating an example of inter prediction in normal inter mode in the decoder.

FIG. 46 is a block diagram illustrating a mounting example of the decoder.

FIG. 47 is a diagram for explaining an outline of dependent Quantization (DQ).

FIG. 48 is a diagram illustrating one example of state transition of a quantizer.

FIG. 49 is a diagram illustrating one example of the state transition of the quantizer.

FIG. 50 is a diagram illustrating one example of binarization of a remainder.

FIG. 51 is a diagram for explaining a method of determining a rice parameter.

FIG. 52 is a diagram illustrating a code length (i.e., the number of bits) of a binary signal obtained by Golomb-Rice coding of a remainder.

FIG. 53 is a flowchart illustrating overall processing operations of an entropy encoder according to a first example of a first aspect.

FIG. 54 is a flowchart illustrating one example of the detailed processing operation of Step S110 illustrated in FIG. 53.

FIG. 55 is a flowchart illustrating one example of the detailed processing operation of Step S120 illustrated in FIG. 53.

FIG. 56 is a flowchart illustrating one example of a detailed processing operation of Step S130 illustrated in FIG. 53.

FIG. 57 is a diagram illustrating syntax related to entropy encoding according to a first example of the first aspect.

FIG. 58 is a diagram illustrating a specific example of a sub-block including 4×4 coefficients.

FIG. 59 is a diagram illustrating a specific example indicating each of the coefficients included in the sub-block illustrated in FIG. 58, in a flag format according to the first example of the first aspect.

FIG. 60 is a flowchart illustrating overall processing operations of an entropy encoder according to a second example of the first aspect.

FIG. 61 is a flowchart illustrating one example of a detailed processing operation of Step S210 illustrated in FIG. 60.

FIG. 62 is a flowchart illustrating one example of a detailed processing operation of Step S220 illustrated in FIG. 60.

FIG. 63 is a flowchart illustrating one example of a detailed processing operation of Step S230 illustrated in FIG. 60. FIG. 64 is a diagram illustrating syntax related to entropy encoding according to the second example of the first aspect.

FIG. 65 is a diagram illustrating a specific example indicating each of the coefficients included in the sub-block illustrated in FIG. 58, in a flag format according to the second example of the first aspect.

FIG. 66 is a flowchart illustrating overall processing operations of an entropy encoder according to the second aspect.

FIG. 67 is a flowchart illustrating one example of a detailed processing operation of Step S330 illustrated in FIG. 66.

FIG. 68 is a diagram illustrating syntax related to entropy encoding according to the second aspect.

FIG. 69 is a diagram illustrating a specific example indicating each of the coefficients included in the sub-block illustrated in FIG. 58, in the flag format according to the second aspect.

FIG. 70 is a flowchart illustrating overall processing operations of an entropy encoder according to a third aspect.

FIG. 71 is a flowchart illustrating one example of the detailed processing operation of Step S430 illustrated in FIG. 70.

FIG. 72 is a flowchart illustrating processing operations performed by an encoder according to Embodiment 2.

FIG. 73 is a flowchart illustrating encoding a remainder performed by the encoder according to Embodiment 2.

FIG. 74 is a flowchart illustrating processing operations performed by a decoder according to Embodiment 2.

FIG. 75 is a flowchart illustrating decoding a remainder performed by the decoder according to Embodiment 2.

FIG. 76 is a block diagram illustrating an overall configuration of a content providing system for implementing a content distribution service.

FIG. 77 is a conceptual diagram illustrating one example of an encoding structure in scalable encoding.

FIG. 78 is a conceptual diagram illustrating one example of an encoding structure in scalable encoding.

FIG. 79 is a conceptual diagram illustrating an example of a display screen of a web page.

FIG. 80 is a conceptual diagram illustrating an example of a display screen of a web page.

FIG. 81 is a block diagram illustrating one example of a smartphone.

FIG. 82 is a block diagram illustrating an example of a configuration of a smartphone.

DETAILED DESCRIPTION

An encoder includes: circuitry; and memory coupled to the circuitry. In the encoder, for each coefficient of a plurality of coefficients included in a block, the circuitry, in operation: determines a base level relating to Context-Based Adaptive Binary Arithmetic Coding (CABAC) for the coefficient; and encodes an absolute value of the coefficient, wherein in determining the base level, when one or more flags are used in encoding the absolute value of the coefficient, the base level is determined to be a first value, and when one or more flags are not used in encoding the absolute value of the coefficient, the base level is determined to be a second value that is smaller than the first value, and in encoding the absolute value of the coefficient, when one or more flags are not used, a rice parameter is determined based on the base level which is equal to the second value, and the coefficient is binarized using the rice parameter.

In the encoder, whether to use a flag of the one or more flags may be determined based on a first condition and a second condition, wherein the first condition may be based on the absolute value of the coefficient, and the second condition may be for limiting a total number of flags used in the block.

In the encoder, in the encoding of the absolute value, the circuitry, every time the flag is encoded, may count a total number of the flags encoded, and when the second condition is not satisfied, may determine that the flag is not to be used in encoding the coefficient, even when the first condition is satisfied, and the second condition may be that a total number of the flags encoded is less than a limit.

In the encoder, the first condition may be one of a condition that the absolute value of the coefficient is not a third value and a condition that the absolute value of the coefficient is greater than a fourth value, the fourth value being greater than the third value.

In the encoder, the first value may be zero, and the second value may be three.

In the encoder, the one or more flags may include flags of mutually different types.

In the encoder, the circuitry, in determining the rice parameter of a first coefficient in the block, may use second to sixth coefficients in the block, the second to the sixth coefficients being located around the first coefficient.

An encoder includes: memory; and a processor coupled to the memory and configured to perform Context-Based Adaptive Binary Arithmetic Coding (CABAC) of H.266/VVC (Versatile Video Coding) standard. In the encoder, the CABAC includes: obtaining a base level corresponding to a first quantized coefficient in a block; calculating absolute values of second to sixth quantized coefficients in the block, the second to the sixth quantized coefficients being provided around the first quantized coefficient in the block; calculating a rice parameter based on the base level and the absolute values; and binarizing the first quantized coefficient based on the rice parameter.

In the encoder, the processor may be configured to calculate the rice parameter based on a difference between each of the absolute values and the base level.

A decoder includes: circuitry; and memory coupled to the circuitry. In the decoder, for each coefficient of a plurality of coefficients included in a block, the circuitry, in operation: determines a base level relating to Context-Based Adaptive Binary Arithmetic Coding (CABAC) for the coefficient; and decodes an absolute value of the coefficient, wherein in determining the base level, when one or more flags are used in decoding the absolute value of the coefficient, the base level is determined to be a first value, and when one or more flags are not used in decoding the absolute value of the coefficient, the base level is determined to be a second value, the second value being smaller than the first value, in decoding the absolute value of the coefficient, when one or more flags are not used, a rice parameter is determined based on the base level which is equal to the second value, and the coefficient is debinarized using the rice parameter.

In the decoder, when each coefficient of the plurality of coefficients included in the block is encoded, whether to use a flag of the one or more flags may be determined based on a first condition and a second condition, wherein the first condition may be based on the absolute value of the coefficient, and the second condition may be for limiting a total number of flags used in the block.

In the decoder, in the decoding of the absolute value, the circuitry, every time the flag is decoded, may count a total number of the flags decoded, and when each coefficient of the plurality of coefficients included in the block is encoded, when the second condition is not satisfied, may determine that the flag is not to be used in encoding the coefficient, even when the first condition is satisfied, and the second condition may be that a total number of the flags encoded is less than a limit.

In the decoder, the first condition may be one of a condition that the absolute value of the coefficient is not a third value and a condition that the absolute value of the coefficient is greater than a fourth value, the fourth value being greater than the third value.

In the decoder, the first value may be zero, and the second value may be three.

In the decoder, the one or more flags may include flags of mutually different types.

In the decoder, the circuitry, in determining the rice parameter of a first coefficient in the block, may use second to sixth coefficients in the block, the second to the sixth coefficients being located around the first coefficient.

A decoder includes: memory; and a processor coupled to the memory and configured to perform decoding by Context-Based Adaptive Binary Arithmetic Coding (CABAC) of H.266/VVC (Versatile Video Coding) standard. In the decoder, the decoding by the CABAC includes: obtaining a base level corresponding to a first quantized coefficient in a block; calculating absolute values of second to sixth quantized coefficients in the block, the second to the sixth quantized coefficients being provided around the first quantized coefficient in the block; calculating a rice parameter based on the base level and the absolute values; and debinarizing the first quantized coefficient based on the rice parameter.

In the decoder, the processor may be configured to calculate the rice parameter based on a difference between each of the absolute values and the base level.

An encoding method includes: for each coefficient of a plurality of coefficients included in a block, determining a base level relating to Context-Based Adaptive Binary Arithmetic Coding (CABAC) for the coefficient; and encoding an absolute value of the coefficient. In the encoding method: in the determining, when one or more flags are used in the encoding, the base level is determined to be a first value, and when one or more flags are not used in the encoding, the base level is determined to be a second value that is smaller than the first value; and in the encoding of the absolute value of the coefficient, when one or more flags are not used, a rice parameter is determined based on the base level which is equal to the second value, and the coefficient is binarized using the rice parameter.

An encoding method includes performing Context-Based Adaptive Binary Arithmetic Coding (CABAC) of H.266/VVC (Versatile Video Coding) standard. In the encoding method, the performing of the CABAC includes: obtaining a base level corresponding to a first quantized coefficient in a block; calculating absolute values of second to sixth quantized coefficients in the block, the second to the sixth quantized coefficients being provided around the first quantized coefficient in the block; calculating a rice parameter based on the base level and the absolute values; and binarizing the first quantized coefficient based on the rice parameter.

A decoding method includes: for each coefficient of a plurality of coefficients included in a block, determining a base level relating to Context-Based Adaptive Binary Arithmetic Coding (CABAC) for the coefficient; and decoding an absolute value of the coefficient. In the decoding method: in the determining, when one or more flags are used in the decoding, the base level is determined to be a first value, and when one or more flags are not used in the decoding, the base level is determined to be a second value that is smaller than the first value; in the decoding, when one or more flags are not used, a rice parameter is determined based on the base level which is equal to the second value, and the coefficient is debinarized using the rice parameter.

A decoding method includes decoding by Context-Based Adaptive Binary Arithmetic Coding (CABAC) of H.266/VVC (Versatile Video Coding) standard. In the decoding, the decoding by the CABAC includes: obtaining a base level corresponding to a first quantized coefficient in a block; calculating absolute values of second to sixth quantized coefficients in the block, the second to the sixth quantized coefficients being provided around the first quantized coefficient in the block; calculating a rice parameter based on the base level and the absolute values; and debinarizing the first quantized coefficient based on the rice parameter.

In view of the above, an encoder according to one aspect of the present disclosure includes circuitry; and memory coupled to the circuitry. In the encoder, the circuitry, in operation, encodes, for each of a plurality of coefficients, an absolute value of the coefficient in predetermined order, the plurality of coefficients being included in a structural unit of an image which has been transformed and quantized, and encodes, for each of the plurality of coefficients, a sign indicating whether the coefficient is positive or negative, in encoding the absolute value, a signal indicating parity that is a least significant bit of the absolute value is encoded, whether to use a flag in encoding a portion of the absolute value other than the least significant bit is determined based on a first condition and a second condition, and the flag is encoded by context-based adaptive binary arithmetic coding (CABAC) involving updating a symbol occurrence probability when it is determined that the flag is to be used, the first condition is based on a magnitude of the absolute value, and the second condition is for limiting a total number of flags used in the structural unit.

In this manner, whether or not to use a flag is determined on the basis of not only the first condition based on the magnitude of an absolute value of a coefficient, but also the second condition for limiting the number of flags, and thus it is possible to appropriately limit the number of flags.

When a flag is to be used, it is possible to reduce a coding amount of an absolute value of a coefficient. When a flag is not to be used, there is a possibility of an increase in a coding amount of an absolute value of a coefficient; that is, a possibility of an increase in a coding amount of a remainder for indicating an absolute value of a coefficient. In addition, there are cases where the CABAC in which an adaptive and variable symbol occurrence probability is used is applied in encoding a flag, and bypass processing of the CABAC in which a fixed symbol occurrence probability is used is applied in encoding a remainder. Here, in the CABAC in which the variable symbol occurrence probability is used, a processing load tends to be higher than the bypass processing. Accordingly, with the encoder according to one aspect of the present disclosure, the number of flags can be appropriately limited, and thus it is possible to reduce both of a coding amount of an absolute value thereof and a processing load for encoding the absolute value.

In addition, in the encoding of the absolute value, the circuitry, every time the flag is encoded, may count a total number of flags encoded, and when the second condition is not satisfied, may determine that the flag is not to be used in the encoding of the portion of the absolute value other than the least significant bit, even when the first condition is satisfied, and the second condition may be that a total number of counts corresponding to a total number of the flags counted is less than a limit.

In this manner, every time a flag is encoded, the number of encoded flags is counted. Accordingly, it is possible to more appropriately limit the number of flags.

In addition, the first condition may be one of a condition that the absolute value is not a first value and a condition that the absolute value is greater than or equal to a second value. For example, the first value may be 0, and the second value may be 3.

With this, for a coefficient whose absolute value is not 0, for example, it is possible to appropriately limit the number of flags (e.g., the gt1_flag) indicating whether the absolute value is greater than or equal to 3. Alternatively, for a coefficient whose absolute value is greater than or equal to 3, for example, it is possible to appropriately limit the number of flags (e.g., the gt2_flag) indicating whether or not the absolute value is greater than or equal to 5.

In addition, the flag may include flags of mutually different types.

With this, for example, it is possible to appropriately limit the number of each of different types of flags such as the above-described gt1_flag and gt2_flag.

In addition, the circuitry, further in the encoding of the absolute value, when the flag cannot be used or when the absolute value cannot be represented by only at least one flag, may derive a remainder including a numerical value for representing the absolute value, and may encode the remainder derived, by bypass processing of the CABAC.

In this manner, it is possible to appropriately encode an absolute value of a coefficient as a flag or as a data group including at least one flag and a remainder.

In addition, the circuitry: in deriving the remainder, may determine a base level indicating a numerical value which varies according to whether a total number of counts has reached a limit, the total number of counts corresponding to a total number of the flags encoded for coefficients located prior to a coefficient corresponding to the remainder among the plurality of the coefficients, and derive the remainder using the base level determined; and in the encoding of the remainder, may select a binarizing method corresponding to the remainder from among a plurality of binarizing methods different from one another, based on the base level used in the deriving of the remainder, binarize the remainder according to the binarizing method selected, and perform arithmetic coding on the remainder binarized. For example, a base level determined when the total number of counts has reached the limit may be less than a base level determined when the total number of counts is less than the limit.

In this manner, it is possible to appropriately derive, using a base level, a remainder corresponding to an absolute value of a coefficient. In addition, since a binarizing method to be used in binarizing a remainder is selected based on the base level, it is possible to appropriately reduce the coding amount of the remainder.

In addition, a decoder according to one aspect of the present disclosure includes circuitry; and memory coupled to the circuitry. In the decoder, the circuitry, in operation, decodes, for each of a plurality of coefficients, an absolute value of the coefficient in predetermined order, the plurality of coefficients being included in a structural unit of an image which has been encoded, and decodes, for each of the plurality of coefficients, a sign indicating whether the coefficient is positive or negative, in the structural unit, among N coefficients each having an absolute value which satisfies a predetermined condition related to a magnitude, a flag is used in encoding an absolute value of each of M coefficients, and the flag is not used in encoding an absolute value of each of remaining (N−M) coefficients, N being an integer greater than or equal to 2, M being an integer less than N, in decoding the absolute value, a signal indicating parity that is a least significant bit of the absolute value is decoded, and when the flag is used in encoding a portion of the absolute value other than the least significant bit, the flag is decoded by context-based adaptive binary arithmetic coding (CABAC) involving updating a symbol occurrence probability.

With this, even when the number of flags used in encoding a structural unit of an image is limited, it is possible to appropriately decode the encoded structural unit of the image.

In addition, the predetermined condition may be one of a condition that the absolute value of the coefficient is not a first value and a condition that the absolute value of the coefficient is greater than or equal to a second value. For example, the first value may be 0, and the second value may be 3.

With this, for a coefficient whose absolute value is not 0, for example, even when the number of the flags (e.g., the gt1_flag) indicating whether the absolute value is greater than or equal to 3 is limited, it is possible to appropriately decode the encoded structural unit of the image. Alternatively, for a coefficient whose absolute value is greater than or equal to 3, for example, even when the number of the flags (e.g., the gt2_flag) indicating whether the absolute value is greater than or equal to 5 is limited, it is possible to appropriately decode the encoded structural unit of the image.

In addition, the flag may include flags of mutually different types.

With this, for example, even when the number of each of the different types of flags such as the above-described gt1_flag and gt2_flag is limited, it is possible to appropriately decode the encoded structural unit of the image.

In addition, the circuitry, further in the decoding of the absolute value, when a remainder including a numerical value for representing the absolute value has been encoded, may decode the remainder by bypass processing of the CABAC

In this manner, even when an absolute value of a coefficient is encoded as a flag or a data group including at least one flag and a remainder, it is possible to appropriately decode the encoded structural unit of the image.

In addition, in decoding the remainder, the circuitry may determine a base level indicating a numerical value which varies according to whether a total number of counts has reached a limit, the total number of counts corresponding to a total number of the flags decoded for coefficients located prior to a coefficient corresponding to the remainder among the plurality of the coefficients, perform arithmetic decoding on the remainder into a binary signal, select a debinarizing method corresponding to the binary signal from among a plurality of debinarizing methods different from one another, based on the base level determined, and debinarize the binary signal according to the debinarizing method selected. For example, a base level determined when the total number of counts has reached the limit is less than a base level determined when the total number of counts may be less than the limit.

In this manner, since a debinarizing method to be used in debinarizing a binary signal is selected based on a base level, it is possible to appropriately decode the remainder.

Alternatively, for example, an encoder according to one aspect of the present disclosure includes a splitter, an intra predictor, an inter predictor, a loop filter, a transformer, a quantizer, and an entropy encoder.

The splitter splits a picture included in an image into a plurality of blocks. The intra predictor predicts a block included in the picture, using the picture. The inter predictor predicts the block, using a reference picture different from the picture. The loop filter applies a filter to an image reconstructed from a prediction image generated as a result of prediction by the intra predictor or the inter predictor.

The transformer transforms a prediction error between the prediction image and the block, to generate a transform coefficient of the block. The quantizer quantizes the transform coefficient. The entropy encoder encodes the transform coefficient which has been quantized.

In addition, for example, the entropy encoder encodes, for each of a plurality of coefficients, an absolute value of the coefficient in predetermined order, the plurality of coefficients being included in a structural unit of an image which has been transformed and quantized, and encodes, for each of the plurality of coefficients, a sign indicating whether the coefficient is positive or negative, in encoding the absolute value, a signal indicating parity that is a least significant bit of the absolute value is encoded, whether to use a flag in encoding a portion of the absolute value other than the least significant bit is determined based on a first condition and a second condition, and the flag is encoded by context-based adaptive binary arithmetic coding (CABAC) involving updating a symbol occurrence probability when it is determined that the flag is to be used, the first condition is based on a magnitude of the absolute value, and the second condition is for limiting a total number of flags used in the structural unit.

Alternatively, for example, the decoder according to one aspect of the present disclosure includes an entropy decoder, an inverse quantizer, an inverse transformer, an intra predictor, an inter predictor, and a loop filter.

The entropy decoder decodes a quantized transform coefficient of a block included in a picture included in an encoded image. The inverse quantizer performs inverse quantization on the quantized transform coefficient. The inverse transformer performs inverse transformation on the transform coefficient, to obtain a prediction error of the block.

The intra predictor predicts the block, using the picture. The inter predictor predicts the block, using a reference picture different from the picture. The loop filter applies a filter to an image reconstructed from a prediction image generated as a result of prediction by the intra predictor or the inter predictor.

In addition, for example, the entropy decoder decodes, for each of a plurality of coefficients, an absolute value of the coefficient in predetermined order, the plurality of coefficients being included in a structural unit of an image which has been encoded, and decodes, for each of the plurality of coefficients, a sign indicating whether the coefficient is positive or negative, in the structural unit, among N coefficients each having an absolute value which satisfies a predetermined condition related to a magnitude, a flag is used in encoding an absolute value of each of M coefficients, and the flag is not used in encoding an absolute value of each of remaining (N−M) coefficients, N being an integer greater than or equal to 2, M being an integer less than N, in decoding the absolute value, a signal indicating parity that is a least significant bit of the absolute value is decoded, and when the flag is used in encoding a portion of the absolute value other than the least significant bit, the flag is decoded by context-based adaptive binary arithmetic coding (CABAC) involving updating a symbol occurrence probability.

Furthermore, these general and specific aspects may be implemented using a system, an apparatus, a method, an integrated circuit, a computer program, or a non-transitory computer-readable recording medium such as a compact disc read only memory (CD-ROM), or any combination of systems, apparatuses, methods, integrated circuits, computer programs, or recording media.

Hereinafter, embodiments will be described with reference to the drawings. Note that the embodiments described below each show a general or specific example. The numerical values, shapes, materials, components, the arrangement and connection of the components, steps, the relation and order of the steps, etc., indicated in the following embodiments are mere examples, and are not intended to limit the scope of the claims.

Embodiments of an encoder and a decoder will be described below. The embodiments are examples of an encoder and a decoder to which the processes and/or configurations presented in the description of aspects of the present disclosure are applicable. The processes and/or configurations can also be implemented in an encoder and a decoder different from those according to the embodiments. For example, regarding the processes and/or configurations as applied to the embodiments, any of the following may be implemented:

(1) Any of the components of the encoder or the decoder according to the embodiments presented in the description of aspects of the present disclosure may be substituted or combined with another component presented anywhere in the description of aspects of the present disclosure.

(2) In the encoder or the decoder according to the embodiments, discretionary changes may be made to functions or processes performed by one or more components of the encoder or the decoder, such as addition, substitution, removal, etc., of the functions or processes. For example, any function or process may be substituted or combined with another function or process presented anywhere in the description of aspects of the present disclosure.

(3) In methods implemented by the encoder or the decoder according to the embodiments, discretionary changes may be made such as addition, substitution, and removal of one or more of the processes included in the method. For example, any process in the method may be substituted or combined with another process presented anywhere in the description of aspects of the present disclosure.

(4) One or more components included in the encoder or the decoder according to embodiments may be combined with a component presented anywhere in the description of aspects of the present disclosure, may be combined with a component including one or more functions presented anywhere in the description of aspects of the present disclosure, and may be combined with a component that implements one or more processes implemented by a component presented in the description of aspects of the present disclosure.

(5) A component including one or more functions of the encoder or the decoder according to the embodiments, or a component that implements one or more processes of the encoder or the decoder according to the embodiments, may be combined or substituted with a component presented anywhere in the description of aspects of the present disclosure, with a component including one or more functions presented anywhere in the description of aspects of the present disclosure, or with a component that implements one or more processes presented anywhere in the description of aspects of the present disclosure.

(6) In methods implemented by the encoder or the decoder according to the embodiments, any of the processes included in the method may be substituted or combined with a process presented anywhere in the description of aspects of the present disclosure or with any corresponding or equivalent process.

(7) One or more processes included in methods implemented by the encoder or the decoder according to the embodiments may be combined with a process presented anywhere in the description of aspects of the present disclosure.

(8) The implementation of the processes and/or configurations presented in the description of aspects of the present disclosure is not limited to the encoder or the decoder according to the embodiments. For example, the processes and/or configurations may be implemented in a device used for a purpose different from the moving picture encoder or the moving picture decoder disclosed in the embodiments.

[Encoder]

First, an encoder according to an embodiment will be described. FIG. 1 is a block diagram illustrating a functional configuration of encoder 100 according to the embodiment. Encoder 100 is a video encoder which encodes a video in units of a block.

As illustrated in FIG. 1, encoder 100 is an apparatus which encodes an image in units of a block, and includes splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, block memory 118, loop filter 120, frame memory 122, intra predictor 124, inter predictor 126, and prediction controller 128.

Encoder 100 is implemented as, for example, a generic processor and memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, loop filter 120, intra predictor 124, inter predictor 126, and prediction controller 128. Alternatively, encoder 100 may be implemented as one or more dedicated electronic circuits corresponding to splitter 102, subtractor 104, transformer 106, quantizer 108, entropy encoder 110, inverse quantizer 112, inverse transformer 114, adder 116, loop filter 120, intra predictor 124, inter predictor 126, and prediction controller 128.

Hereinafter, an overall flow of processes performed by encoder 100 is described, and then each of constituent elements included in encoder 100 will be described.

[Overall Flow of Encoding Process]

FIG. 2 is a flow chart indicating one example of an overall encoding process performed by encoder 100.

First, splitter 102 of encoder 100 splits each of pictures included in an input image which is a video into a plurality of blocks having a fixed size (e.g., 128×128 pixels) (Step Sa_1). Splitter 102 then selects a splitting pattern for the fixed-size block (also referred to as a block shape) (Step Sa_2). In other words, splitter 102 further splits the fixed-size block into a plurality of blocks which form the selected splitting pattern. Encoder 100 performs, for each of the plurality of blocks, Steps Sa_3 to Sa_9 for the block (that is a current block to be encoded).

In other words, a prediction processor which includes all or part of intra predictor 124, inter predictor 126, and prediction controller 128 generates a prediction signal (also referred to as a prediction block) of the current block to be encoded (also referred to as a current block) (Step Sa_3).

Next, subtractor 104 generates a difference between the current block and a prediction block as a prediction residual (also referred to as a difference block) (Step Sa_4).

Next, transformer 106 transforms the difference block and quantizer 108 quantizes the result, to generate a plurality of quantized coefficients (Step Sa_5). It is to be noted that the block having the plurality of quantized coefficients is also referred to as a coefficient block.

Next, entropy encoder 110 encodes (specifically, entropy encodes) the coefficient block and a prediction parameter related to generation of a prediction signal to generate an encoded signal (Step Sa_6). It is to be noted that the encoded signal is also referred to as an encoded bitstream, a compressed bitstream, or a stream.

Next, inverse quantizer 112 performs inverse quantization of the coefficient block and inverse transformer 114 performs inverse transform of the result, to restore a plurality of prediction residuals (that is, a difference block) (Step Sa_7).

Next, adder 116 adds the prediction block to the restored difference block to reconstruct the current block as a reconstructed image (also referred to as a reconstructed block or a decoded image block) (Step Sa_8). In this way, the reconstructed image is generated.

When the reconstructed image is generated, loop filter 120 performs filtering of the reconstructed image as necessary (Step Sa_9).

Encoder 100 then determines whether encoding of the entire picture has been finished (Step Sa_10). When determining that the encoding has not yet been finished (No in Step Sa_10), processes from Step Sa_2 are executed repeatedly.

Although encoder 100 selects one splitting pattern for a fixed-size block, and encodes each block according to the splitting pattern in the above-described example, it is to be noted that each block may be encoded according to a corresponding one of a plurality of splitting patterns. In this case, encoder 100 may evaluate a cost for each of the plurality of splitting patterns, and, for example, may select the encoded signal obtainable by encoding according to the splitting pattern which yields the smallest cost as an encoded signal which is output.

As illustrated, the processes in Steps Sa_1 to Sa_10 are performed sequentially by encoder 100. Alternatively, two or more of the processes may be performed in parallel, the processes may be reordered, etc.

[Splitter]

Splitter 102 splits each of pictures included in an input video into a plurality of blocks, and outputs each block to subtractor 104. For example, splitter 102 first splits a picture into blocks of a fixed size (for example, 128×128). Other fixed block sizes may be employed. The fixed-size block is also referred to as a coding tree unit (CTU). Splitter 102 then splits each fixed-size block into blocks of variable sizes (for example, 64×64 or smaller), based on recursive quadtree and/or binary tree block splitting. In other words, splitter 102 selects a splitting pattern. The variable-size block is also referred to as a coding unit (CU), a prediction unit (PU), or a transform unit (TU). It is to be noted that, in various kinds of processing examples, there is no need to differentiate between CU, PU, and TU; all or some of the blocks in a picture may be processed in units of a CU, a PU, or a TU.

FIG. 3 is a conceptual diagram illustrating one example of block splitting according to an embodiment. In FIG. 3, the solid lines represent block boundaries of blocks split by quadtree block splitting, and the dashed lines represent block boundaries of blocks split by binary tree block splitting.

Here, block 10 is a square block having 128×128 pixels (128×128 block). This 128×128 block 10 is first split into four square 64×64 blocks (quadtree block splitting). The upper-left 64×64 block is further vertically split into two rectangular 32×64 blocks, and the left 32×64 block is further vertically split into two rectangular 16×64 blocks (binary tree block splitting). As a result, the upper-left 64×64 block is split into two 16×64 blocks 11 and 12 and one 32×64 block 13.

The upper-right 64×64 block is horizontally split into two rectangular 64×32 blocks 14 and 15 (binary tree block splitting).

The lower-left 64×64 block is first split into four square 32×32 blocks (quadtree block splitting). The upper-left block and the lower-right block among the four 32×32 blocks are further split. The upper-left 32×32 block is vertically split into two rectangle 16×32 blocks, and the right 16×32 block is further horizontally split into two 16×16 blocks (binary tree block splitting). The lower-right 32×32 block is horizontally split into two 32×16 blocks (binary tree block splitting). As a result, the lower-left 64×64 block is split into 16×32 block 16, two 16×16 blocks 17 and 18, two 32×32 blocks 19 and 20, and two 32×16 blocks 21 and 22.

The lower-right 64×64 block 23 is not split.

As described above, in FIG. 3, block 10 is split into thirteen variable-size blocks 11 through 23 based on recursive quadtree and binary tree block splitting. This type of splitting is also referred to as quadtree plus binary tree (QTBT) splitting.

It is to be noted that, in FIG. 3, one block is split into four or two blocks (quadtree or binary tree block splitting), but splitting is not limited to these examples. For example, one block may be split into three blocks (ternary block splitting). Splitting including such ternary block splitting is also referred to as multi-type tree (MBT) splitting.

[Picture Structure: Slice/Tile]

A picture may be configured in units of one or more slices or tiles in order to decode the picture in parallel. The picture configured in units of one or more slices or tiles may be configured by splitter 102.

Slices are basic encoding units included in a picture. A picture may include, for example, one or more slices. In addition, a slice includes one or more successive coding tree units (CTU).

FIG. 4A is a conceptual diagram illustrating one example of a slice configuration. For example, a picture includes 11×8 CTUs and is split into four slices (slices 1 to 4). Slice 1 includes sixteen CTUs, slice 2 includes twenty-one CTUs, slice 3 includes twenty-nine CTUs, and slice 4 includes twenty-two CTUs. Here, each CTU in the picture belongs to one of the slices. The shape of each slice is a shape obtainable by splitting the picture horizontally. A boundary of each slice does not need to be coincide with an image end, and may be coincide with any of the boundaries between CTUs in the image. The processing order of the CTUs in a slice (an encoding order or a decoding order) is, for example, a raster-scan order. A slice includes header information and encoded data. Features of the slice may be described in header information. The features include a CTU address of a top CTU in the slice, a slice type, etc.

A tile is a unit of a rectangular region included in a picture. Each of tiles may be assigned with a number referred to as TileId in raster-scan order.

FIG. 4B is a conceptual diagram indicating an example of a tile configuration. For example, a picture includes 11×8 CTUs and is split into four tiles of rectangular regions (tiles 1 to 4). When tiles are used, the processing order of CTUs are changed from the processing order in the case where no tile is used. When no tile is used, CTUs in a picture are processed in raster-scan order. When tiles are used, at least one CTU in each of the tiles is processed in raster-scan order. For example, as illustrated in FIG. 4B, the processing order of the CTUs included in tile 1 is the order which starts from the left-end of the first row of tile 1 toward the right-end of the first row of tile 1 and then starts from the left-end of the second row of tile 1 toward the right-end of the second row of tile 1.

It is to be noted that the one tile may include one or more slices, and one slice may include one or more tiles.

[Subtractor]

Subtractor 104 subtracts a prediction signal (prediction sample that is input from prediction controller 128 indicated below) from an original signal (original sample) in units of a block input from splitter 102 and split by splitter 102. In other words, subtractor 104 calculates prediction errors (also referred to as residuals) of a block to be encoded (hereinafter also referred to as a current block). Subtractor 104 then outputs the calculated prediction errors (residuals) to transformer 106.

The original signal is a signal which has been input into encoder 100 and represents an image of each picture included in a video (for example, a luma signal and two chroma signals). Hereinafter, a signal representing an image is also referred to as a sample.

[Transformer]

Transformer 106 transforms prediction errors in spatial domain into transform coefficients in frequency domain, and outputs the transform coefficients to quantizer 108. More specifically, transformer 106 applies, for example, a defined discrete cosine transform (DCT) or discrete sine transform (DST) to prediction errors in spatial domain. The defined DCT or DST may be predefined.

It is to be noted that transformer 106 may adaptively select a transform type from among a plurality of transform types, and transform prediction errors into transform coefficients by using a transform basis function corresponding to the selected transform type. This sort of transform is also referred to as explicit multiple core transform (EMT) or adaptive multiple transform (AMT).

The transform types include, for example, DCT-II, DCT-V, DCT-VIII, DST-I, and DST-VII. FIG. 5A is a chart indicating transform basis functions for the example transform types. In FIG. 5A, N indicates the number of input pixels. For example, selection of a transform type from among the plurality of transform types may depend on a prediction type (one of intra prediction and inter prediction), and may depend on an intra prediction mode.

Information indicating whether to apply such EMT or AMT (referred to as, for example, an EMT flag or an AMT flag) and information indicating the selected transform type is normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the bit sequence level, picture level, slice level, tile level, or CTU level).

In addition, transformer 106 may re-transform the transform coefficients (transform result). Such re-transform is also referred to as adaptive secondary transform (AST) or non-separable secondary transform (NSST). For example, transformer 106 performs re-transform in units of a sub-block (for example, 4×4 sub-block) included in a transform coefficient block corresponding to an intra prediction error. Information indicating whether to apply NSST and information related to a transform matrix for use in NSST are normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, or CTU level).

Transformer 106 may employ a separable transform and a non-separable transform. A separable transform is a method in which a transform is performed a plurality of times by separately performing a transform for each of a number of directions according to the number of dimensions of inputs. A non-separable transform is a method of performing a collective transform in which two or more dimensions in multidimensional inputs are collectively regarded as a single dimension.

In one example of a non-separable transform, when an input is a 4×4 block, the 4×4 block is regarded as a single array including sixteen elements, and the transform applies a 16×16 transform matrix to the array.

In another example of a non-separable transform, a 4×4 input block is regarded as a single array including sixteen elements, and then a transform (hypercube givens transform) in which givens revolution is performed on the array a plurality of times may be performed.

In the transform in transformer 106, the types of bases to be transformed into the frequency domain according to regions in a CU can be switched. Examples include spatially varying transforms (SVT). In SVT, as illustrated in FIG. 5B, CUs are split into two equal regions horizontally or vertically, and only one of the regions is transformed into the frequency domain. A transform basis type can be set for each region. For example, DST7 and DST8 are used. In this example, only one of these two regions in the CU is transformed, and the other is not transformed. However, both of these two regions may be transformed. In addition, the splitting method is not limited to the splitting into two equal regions, and can be more flexible. For example, the CU may be split into four equal regions, or information indicating splitting may be encoded separately and be signaled in the same manner as the CU splitting. It is to be noted that SVT is also referred to as sub-block transform (SBT).

[Quantizer]

Quantizer 108 quantizes the transform coefficients output from transformer 106. More specifically, quantizer 108 scans, in a determined scanning order, the transform coefficients of the current block, and quantizes the scanned transform coefficients based on quantization parameters (QP) corresponding to the transform coefficients. Quantizer 108 then outputs the quantized transform coefficients (hereinafter also referred to as quantized coefficients) of the current block to entropy encoder 110 and inverse quantizer 112. The determined scanning order may be predetermined.

A determined scanning order is an order for quantizing/inverse quantizing transform coefficients. For example, a determined scanning order may be defined as ascending order of frequency (from low to high frequency) or descending order of frequency (from high to low frequency).

A quantization parameter (QP) is a parameter defining a quantization step (quantization width). For example, when the value of the quantization parameter increases, the quantization step also increases. In other words, when the value of the quantization parameter increases, the quantization error increases.

In addition, a quantization matrix may be used for quantization. For example, several kinds of quantization matrices may be used correspondingly to frequency transform sizes such as 4×4 and 8×8, prediction modes such as intra prediction and inter prediction, and pixel components such as luma and chroma pixel components. It is to be noted that quantization means digitalizing values sampled at determined intervals correspondingly to determined levels. In this technical field, quantization may be referred to using other expressions, such as rounding and scaling, and may employ rounding and scaling. The determined intervals and levels may be predetermined.

Methods using quantization matrices include a method using a quantization matrix which has been set directly at the encoder side and a method using a quantization matrix which has been set as a default (default matrix). At the encoder side, a quantization matrix suitable for features of an image can be set by directly setting a quantization matrix. This case, however, has a disadvantage of increasing a coding amount for encoding the quantization matrix.

There is a method for quantizing a high-frequency coefficient and a low-frequency coefficient without using a quantization matrix. It is to be noted that this method is equivalent to a method using a quantization matrix (flat matrix) whose coefficients have the same value.

The quantization matrix may be specified using, for example, a sequence parameter set (SPS) or a picture parameter set (PPS). The SPS includes a parameter which is used for a sequence, and the PPS includes a parameter which is used for a picture. Each of the SPS and the PPS may be simply referred to as a parameter set.

[Entropy Encoder]

Entropy encoder 110 generates an encoded signal (encoded bitstream) based on quantized coefficients which have been input from quantizer 108. More specifically, entropy encoder 110, for example, binarizes quantized coefficients, and arithmetically encodes the binary signal, and outputs a compressed bit stream or sequence.

[Inverse Quantizer]

Inverse quantizer 112 inverse quantizes quantized coefficients which have been input from quantizer 108. More specifically, inverse quantizer 112 inverse quantizes, in a determined scanning order, quantized coefficients of the current block. Inverse quantizer 112 then outputs the inverse quantized transform coefficients of the current block to inverse transformer 114. The determined scanning order may be predetermined.

[Inverse Transformer]

Inverse transformer 114 restores prediction errors (residuals) by inverse transforming transform coefficients which have been input from inverse quantizer 112. More specifically, inverse transformer 114 restores the prediction errors of the current block by applying an inverse transform corresponding to the transform applied by transformer 106 on the transform coefficients. Inverse transformer 114 then outputs the restored prediction errors to adder 116.

It is to be noted that since information is lost in quantization, the restored prediction errors do not match the prediction errors calculated by subtractor 104. In other words, the restored prediction errors normally include quantization errors.

[Adder]

Adder 116 reconstructs the current block by adding prediction errors which have been input from inverse transformer 114 and prediction samples which have been input from prediction controller 128. Adder 116 then outputs the reconstructed block to block memory 118 and loop filter 120. A reconstructed block is also referred to as a local decoded block.

[Block Memory]

Block memory 118 is, for example, storage for storing blocks in a picture to be encoded (hereinafter referred to as a current picture) which is referred to in intra prediction. More specifically, block memory 118 stores reconstructed blocks output from adder 116.

[Frame Memory]

Frame memory 122 is, for example, storage for storing reference pictures for use in inter prediction, and is also referred to as a frame buffer. More specifically, frame memory 122 stores reconstructed blocks filtered by loop filter 120.

[Loop Filter]

Loop filter 120 applies a loop filter to blocks reconstructed by adder 116, and outputs the filtered reconstructed blocks to frame memory 122. A loop filter is a filter used in an encoding loop (in-loop filter), and includes, for example, a deblocking filter (DF or DBF), a sample adaptive offset (SAO), and an adaptive loop filter (ALF).

In an ALF, a least square error filter for removing compression artifacts is applied. For example, one filter selected from among a plurality of filters based on the direction and activity of local gradients is applied for each of 2×2 sub-blocks in the current block.

More specifically, first, each sub-block (for example, each 2×2 sub-block) is categorized into one out of a plurality of classes (for example, fifteen or twenty-five classes). The classification of the sub-block is based on gradient directionality and activity. For example, classification index C (for example, C=5D+A) is derived based on gradient directionality D (for example, 0 to 2 or 0 to 4) and gradient activity A (for example, 0 to 4). Then, based on classification index C, each sub-block is categorized into one out of a plurality of classes.

For example, gradient directionality D is calculated by comparing gradients of a plurality of directions (for example, the horizontal, vertical, and two diagonal directions). Moreover, for example, gradient activity A is calculated by adding gradients of a plurality of directions and quantizing the result of addition.

The filter to be used for each sub-block is determined from among the plurality of filters based on the result of such categorization.

The filter shape to be used in an ALF is, for example, a circular symmetric filter shape. FIG. 6A through FIG. 6C illustrate examples of filter shapes used in ALFs. FIG. 6A illustrates a 5×5 diamond shape filter, FIG. 6B illustrates a 7×7 diamond shape filter, and FIG. 6C illustrates a 9×9 diamond shape filter. Information indicating the filter shape is normally signaled at the picture level. It is to be noted that the signaling of such information indicating the filter shape does not necessarily need to be performed at the picture level, and may be performed at another level (for example, at the sequence level, slice level, tile level, CTU level, or CU level).

The ON or OFF of the ALF is determined, for example, at the picture level or CU level. For example, the decision of whether to apply the ALF to luma may be made at the CU level, and the decision of whether to apply ALF to chroma may be made at the picture level. Information indicating ON or OFF of the ALF is normally signaled at the picture level or CU level. It is to be noted that the signaling of information indicating ON or OFF of the ALF does not necessarily need to be performed at the picture level or CU level, and may be performed at another level (for example, at the sequence level, slice level, tile level, or CTU level).

The coefficient set for the plurality of selectable filters (for example, fifteen or up to twenty-five filters) is normally signaled at the picture level. It is to be noted that the signaling of the coefficient set does not necessarily need to be performed at the picture level, and may be performed at another level (for example, at the sequence level, slice level, tile level, CTU level, CU level, or sub-block level).

[Loop Filter>Deblocking Filter]

In a deblocking filter, loop filter 120 performs a filter process on a block boundary in a reconstructed image so as to reduce distortion which occurs at the block boundary.

FIG. 7 is a block diagram illustrating one example of a specific configuration of loop filter 120 which functions as a deblocking filter.

Loop filter 120 includes: boundary determiner 1201; filter determiner 1203; filtering executor 1205; process determiner 1208; filter characteristic determiner 1207; and switches 1202, 1204, and 1206.

Boundary determiner 1201 determines whether a pixel to be deblock-filtered (that is, a current pixel) is present around a block boundary. Boundary determiner 1201 then outputs the determination result to switch 1202 and processing determiner 1208.

In the case where boundary determiner 1201 has determined that a current pixel is present around a block boundary, switch 1202 outputs an unfiltered image to switch 1204. In the opposite case where boundary determiner 1201 has determined that no current pixel is present around a block boundary, switch 1202 outputs an unfiltered image to switch 1206.

Filter determiner 1203 determines whether to perform deblocking filtering of the current pixel, based on the pixel value of at least one surrounding pixel located around the current pixel. Filter determiner 1203 then outputs the determination result to switch 1204 and processing determiner 1208.

In the case where filter determiner 1203 has determined to perform deblocking filtering of the current pixel, switch 1204 outputs the unfiltered image obtained through switch 1202 to filtering executor 1205. In the opposite case were filter determiner 1203 has determined not to perform deblocking filtering of the current pixel, switch 1204 outputs the unfiltered image obtained through switch 1202 to switch 1206.

When obtaining the unfiltered image through switches 1202 and 1204, filtering executor 1205 executes, for the current pixel, deblocking filtering with the filter characteristic determined by filter characteristic determiner 1207. Filtering executor 1205 then outputs the filtered pixel to switch 1206.

Under control by processing determiner 1208, switch 1206 selectively outputs a pixel which has not been deblock-filtered and a pixel which has been deblock-filtered by filtering executor 1205.

Processing determiner 1208 controls switch 1206 based on the results of determinations made by boundary determiner 1201 and filter determiner 1203. In other words, processing determiner 1208 causes switch 1206 to output the pixel which has been deblock-filtered when boundary determiner 1201 has determined that the current pixel is present around the block boundary and filter determiner 1203 has determined to perform deblocking filtering of the current pixel. In addition, other than the above case, processing determiner 1208 causes switch 1206 to output the pixel which has not been deblock-filtered. A filtered image is output from switch 1206 by repeating output of a pixel in this way.

FIG. 8 is a conceptual diagram indicating an example of a deblocking filter having a symmetrical filtering characteristic with respect to a block boundary.

In a deblocking filter process, one of two deblocking filters having different characteristics, that is, a strong filter and a weak filter is selected using pixel values and quantization parameters. In the case of the strong filter, pixels p0 to p2 and pixels q0 to q2 are present across a block boundary as illustrated in FIG. 8, the pixel values of the respective pixel q0 to q2 are changed to pixel values q′0 to q′2 by performing, for example, computations according to the expressions below.

Q′0=(p1+2×p0+2×q0+2×q1+q2+4)/8

Q′1=(p0+q0+q1+q2+2)/4

Q′2=(p0+q0+q1+3×q2+2×q3+4)/8

It is to be noted that, in the above expressions, p0 to p2 and q0 to q2 are the pixel values of respective pixels p0 to p2 and pixels q0 to q2. In addition, q3 is the pixel value of neighboring pixel q3 located at the opposite side of pixel q2 with respect to the block boundary. In addition, in the right side of each of the expressions, coefficients which are multiplied with the respective pixel values of the pixels to be used for deblocking filtering are filter coefficients.

Furthermore, in the deblocking filtering, clipping may be performed so that the calculated pixel values are not set over a threshold value. In the clipping process, the pixel values calculated according to the above expressions are clipped to a value obtained according to “a computation pixel value±2× a threshold value” using the threshold value determined based on a quantization parameter. In this way, it is possible to prevent excessive smoothing.

FIG. 9 is a conceptual diagram for illustrating a block boundary on which a deblocking filter process is performed. FIG. 10 is a conceptual diagram indicating examples of Bs values.

The block boundary on which the deblocking filter process is performed is, for example, a boundary between prediction units (PU) having 8×8 pixel blocks as illustrated in FIG. 9 or a boundary between transform units (TU). The deblocking filter process may be performed in units of four rows or four columns. First, boundary strength (Bs) values are determined as indicated in FIG. 10 for block P and block Q illustrated in FIG. 9.

According to the Bs values in FIG. 10, whether to perform deblocking filter processes of block boundaries belonging to the same image using different strengths is determined. The deblocking filter process for a chroma signal is performed when a Bs value is 2. The deblocking filter process for a luma signal is performed when a Bs value is 1 or more and a determined condition is satisfied. The determined condition may be predetermined. It is to be noted that conditions for determining Bs values are not limited to those indicated in FIG. 10, and a Bs value may be determined based on another parameter.

[Prediction Processor (Intra Predictor, Inter Predictor, Prediction Controller)]

FIG. 11 is a flow chart illustrating one example of a process performed by the prediction processor of encoder 100. It is to be noted that the prediction processor includes all or part of the following constituent elements: intra predictor 124; inter predictor 126; and prediction controller 128.

The prediction processor generates a prediction image of a current block (Step Sb_1). This prediction image is also referred to as a prediction signal or a prediction block. It is to be noted that the prediction signal is, for example, an intra prediction signal or an inter prediction signal. Specifically, the prediction processor generates the prediction image of the current block using a reconstructed image which has been already obtained through generation of a prediction block, generation of a difference block, generation of a coefficient block, restoring of a difference block, and generation of a decoded image block.

The reconstructed image may be, for example, an image in a reference picture, or an image of an encoded block in a current picture which is the picture including the current block. The encoded block in the current picture is, for example, a neighboring block of the current block.

FIG. 12 is a flow chart illustrating another example of a process performed by the prediction processor of encoder 100.

The prediction processor generates a prediction image using a first method (Step Sc_1 a), generates a prediction image using a second method (Step Sc_1 b), and generates a prediction image using a third method (Step Sc_1 c). The first method, the second method, and the third method may be mutually different methods for generating a prediction image. Each of the first to third methods may be an inter prediction method, an intra prediction method, or another prediction method. The above-described reconstructed image may be used in these prediction methods.

Next, the prediction processor selects any one of a plurality of prediction methods generated in Steps Sc_1 a, Sc_1 b, and Sc_1 c (Step Sc_2). The selection of the prediction image, that is selection of a method or a mode for obtaining a final prediction image may be made by calculating a cost for each of the generated prediction images and based on the cost. Alternatively, the selection of the prediction image may be made based on a parameter which is used in an encoding process. Encoder 100 may transform information for identifying a selected prediction image, a method, or a mode into an encoded signal (also referred to as an encoded bitstream). The information may be, for example, a flag or the like. In this way, the decoder is capable of generating a prediction image according to the method or the mode selected based on the information in encoder 100. It is to be noted that, in the example illustrated in FIG. 12, the prediction processor selects any of the prediction images after the prediction images are generated using the respective methods. However, the prediction processor may select a method or a mode based on a parameter for use in the above-described encoding process before generating prediction images, and may generate a prediction image according to the method or mode selected.

For example, the first method and the second method may be intra prediction and inter prediction, respectively, and the prediction processor may select a final prediction image for a current block from prediction images generated according to the prediction methods.

FIG. 13 is a flow chart illustrating another example of a process performed by the prediction processor of encoder 100.

First, the prediction processor generates a prediction image using intra prediction (Step Sd_1 a), and generates a prediction image using inter prediction (Step Sd_1 b). It is to be noted that the prediction image generated by intra prediction is also referred to as an intra prediction image, and the prediction image generated by inter prediction is also referred to as an inter prediction image.

Next, the prediction processor evaluates each of the intra prediction image and the inter prediction image (Step Sd_2). A cost may be used in the evaluation. In other words, the prediction processor calculates cost C for each of the intra prediction image and the inter prediction image. Cost C may be calculated according to an expression of an R-D optimization model, for example, C=D+λ×R. In this expression, D indicates a coding distortion of a prediction image, and is represented as, for example, a sum of absolute differences between the pixel value of a current block and the pixel value of a prediction image. In addition, R indicates a predicted coding amount of a prediction image, specifically, the coding amount required to encode motion information for generating a prediction image, etc. In addition, λ indicates, for example, a multiplier according to the method of Lagrange multiplier.

The prediction processor then selects the prediction image for which the smallest cost C has been calculated among the intra prediction image and the inter prediction image, as the final prediction image for the current block (Step Sd_3). In other words, the prediction method or the mode for generating the prediction image for the current block is selected.

[Intra Predictor]

Intra predictor 124 generates a prediction signal (intra prediction signal) by performing intra prediction (also referred to as intra frame prediction) of the current block by referring to a block or blocks in the current picture and stored in block memory 118. More specifically, intra predictor 124 generates an intra prediction signal by performing intra prediction by referring to samples (for example, luma and/or chroma values) of a block or blocks neighboring the current block, and then outputs the intra prediction signal to prediction controller 128.

For example, intra predictor 124 performs intra prediction by using one mode from among a plurality of intra prediction modes which have been defined. The intra prediction modes include one or more non-directional prediction modes and a plurality of directional prediction modes. The defined modes may be predefined.

The one or more non-directional prediction modes include, for example, the planar prediction mode and DC prediction mode defined in the H.265/high-efficiency video coding (HEVC) standard.

The plurality of directional prediction modes include, for example, the thirty-three directional prediction modes defined in the H.265/HEVC standard. It is to be noted that the plurality of directional prediction modes may further include thirty-two directional prediction modes in addition to the thirty-three directional prediction modes (for a total of sixty-five directional prediction modes). FIG. 14 is a conceptual diagram illustrating sixty-seven intra prediction modes in total that may be used in intra prediction (two non-directional prediction modes and sixty-five directional prediction modes). The solid arrows represent the thirty-three directions defined in the H.265/HEVC standard, and the dashed arrows represent the additional thirty-two directions (the two non-directional prediction modes are not illustrated in FIG. 14).

In various kinds of processing examples, a luma block may be referred to in intra prediction of a chroma block. In other words, a chroma component of the current block may be predicted based on a luma component of the current block. Such intra prediction is also referred to as cross-component linear model (CCLM) prediction. The intra prediction mode for a chroma block in which such a luma block is referred to (also referred to as, for example, a CCLM mode) may be added as one of the intra prediction modes for chroma blocks.

Intra predictor 124 may correct intra-predicted pixel values based on horizontal/vertical reference pixel gradients. Intra prediction accompanied by this sort of correcting is also referred to as position dependent intra prediction combination (PDPC). Information indicating whether to apply PDPC (referred to as, for example, a PDPC flag) is normally signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, or CTU level).

[Inter Predictor]

Inter predictor 126 generates a prediction signal (inter prediction signal) by performing inter prediction (also referred to as inter frame prediction) of the current block by referring to a block or blocks in a reference picture, which is different from the current picture and is stored in frame memory 122. Inter prediction is performed in units of a current block or a current sub-block (for example, a 4×4 block) in the current block. For example, inter predictor 126 performs motion estimation in a reference picture for the current block or the current sub-block, and finds out a reference block or a sub-block which best matches the current block or the current sub-block. Inter predictor 126 then obtains motion information (for example, a motion vector) which compensates a motion or a change from the reference block or the sub-block to the current block or the sub-block. Inter predictor 126 generates an inter prediction signal of the current block or the sub-block by performing motion compensation (or motion prediction) based on the motion information. Inter predictor 126 outputs the generated inter prediction signal to prediction controller 128.

The motion information used in motion compensation may be signaled as inter prediction signals in various forms. For example, a motion vector may be signaled. As another example, the difference between a motion vector and a motion vector predictor may be signaled.

[Basic Flow of Inter Prediction]

FIG. 15 is a flow chart illustrating an example basic processing flow of inter prediction.

First, inter predictor 126 generates a prediction signal (Steps Se_1 to Se_3). Next, subtractor 104 generates the difference between a current block and a prediction image as a prediction residual (Step Se_4). Here, in the generation of the prediction image, inter predictor 126 generates the prediction image through determination of a motion vector (MV) of the current block (Steps Se_1 and Se_2) and motion compensation (Step Se_3). Furthermore, in determination of an MV, inter predictor 126 determines the MV through selection of a motion vector candidate (MV candidate) (Step Se_1) and derivation of an MV (Step Se_2). The selection of the MV candidate is made by, for example, selecting at least one MV candidate from an MV candidate list. Alternatively, in derivation of an MV, inter predictor 126 may further select at least one MV candidate from the at least one MV candidate, and determine the selected at least one MV candidate as the MV for the current block. Alternatively, inter predictor 126 may determine the MV for the current block by performing estimation in a reference picture region specified by each of the selected at least one MV candidate. It is to be noted that the estimation in a reference picture region may be referred to as motion estimation.

In addition, although Steps Se_1 to Se_3 are performed by inter predictor 126 in the above-described example, a process that is for example Step Se_1, Step Se_2, or the like may be performed by another constituent element included in encoder 100.

[Motion Vector Derivation Flow]

FIG. 16 is a flow chart illustrating one example of derivation of motion vectors.

Inter predictor 126 derives an MV of a current block in a mode for encoding motion information (for example, an MV). In this case, for example, the motion information is encoded as a prediction parameter, and is signaled. In other words, the encoded motion information is included in an encoded signal (also referred to as an encoded bitstream).

Alternatively, inter predictor 126 derives an MV in a mode in which motion information is not encoded. In this case, no motion information is included in an encoded signal.

Here, MV derivation modes may include a normal inter mode, a merge mode, a FRUC mode, an affine mode, etc., which are described later. Modes in which motion information is encoded among the modes include the normal inter mode, the merge mode, the affine mode (specifically, an affine inter mode and an affine merge mode), etc. It is to be noted that motion information may include not only an MV but also motion vector predictor selection information which is described later. Modes in which no motion information is encoded include the FRUC mode, etc. Inter predictor 126 selects a mode for deriving an MV of the current block from the modes, and derives the MV of the current block using the selected mode.

FIG. 17 is a flow chart illustrating another example of derivation of motion vectors.

Inter predictor 126 derives an MV of a current block in a mode in which an MV difference is encoded. In this case, for example, the MV difference is encoded as a prediction parameter, and is signaled. In other words, the encoded MV difference is included in an encoded signal. The MV difference is the difference between the MV of the current block and the MV predictor.

Alternatively, inter predictor 126 derives an MV in a mode in which no MV difference is encoded. In this case, no encoded MV difference is included in an encoded signal.

Here, as described above, the MV derivation modes include the normal inter mode, the merge mode, the FRUC mode, the affine mode, etc., which are described later. Modes in which an MV difference is encoded among the modes include the normal inter mode, the affine mode (specifically, the affine inter mode), etc. Modes in which no MV difference is encoded include the FRUC mode, the merge mode, the affine mode (specifically, the affine merge mode), etc. Inter predictor 126 selects a mode for deriving an MV of the current block from the plurality of modes, and derives the MV of the current block using the selected mode.

[Motion Vector Derivation Flow]

FIG. 18 is a flow chart illustrating another example of derivation of motion vectors. The MV derivation modes which are inter prediction modes include a plurality of modes and are roughly divided into modes in which an MV difference is encoded and modes in which no motion vector difference is encoded. The modes in which no MV difference is encoded include the merge mode, the FRUC mode, the affine mode (specifically, the affine merge mode), etc. These modes are described in detail later. Simply, the merge mode is a mode for deriving an MV of a current block by selecting a motion vector from an encoded surrounding block, and the FRUC mode is a mode for deriving an MV of a current block by performing estimation between encoded regions. The affine mode is a mode for deriving, as an MV of a current block, a motion vector of each of a plurality of sub-blocks included in the current block, assuming affine transform.

More specifically, as illustrated when the inter prediction mode information indicates 0 (0 in Sf_1), inter predictor 126 derives a motion vector using the merge mode (Sf_2). When the inter prediction mode information indicates 1 (1 in Sf_1), inter predictor 126 derives a motion vector using the FRUC mode (Sf_3). When the inter prediction mode information indicates 2 (2 in Sf_1), inter predictor 126 derives a motion vector using the affine mode (specifically, the affine merge mode) (Sf_4). When the inter prediction mode information indicates 3 (3 in Sf_1), inter predictor 126 derives a motion vector using a mode in which an MV difference is encoded (for example, a normal inter mode (Sf_5).

[MV Derivation>Normal Inter Mode]

The normal inter mode is an inter prediction mode for deriving an MV of a current block based on a block similar to the image of the current block from a reference picture region specified by an MV candidate. In this normal inter mode, an MV difference is encoded.

FIG. 19 is a flow chart illustrating an example of inter prediction in normal inter mode.

First, inter predictor 126 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of encoded blocks temporally or spatially surrounding the current block (Step Sg_1). In other words, inter predictor 126 generates an MV candidate list.

Next, inter predictor 126 extracts N (an integer of 2 or larger) MV candidates from the plurality of MV candidates obtained in Step Sg_1, as motion vector predictor candidates (also referred to as MV predictor candidates) according to a determined priority order (Step Sg_2). It is to be noted that the priority order may be determined in advance for each of the N MV candidates.

Next, inter predictor 126 selects one motion vector predictor candidate from the N motion vector predictor candidates, as the motion vector predictor (also referred to as an MV predictor) of the current block (Step Sg_3). At this time, inter predictor 126 encodes, in a stream, motion vector predictor selection information for identifying the selected motion vector predictor. It is to be noted that the stream is an encoded signal or an encoded bitstream as described above.

Next, inter predictor 126 derives an MV of a current block by referring to an encoded reference picture (Step Sg_4). At this time, inter predictor 126 further encodes, in the stream, the difference value between the derived MV and the motion vector predictor as an MV difference. It is to be noted that the encoded reference picture is a picture including a plurality of blocks which have been reconstructed after being encoded.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Sg_5). It is to be noted that the prediction image is an inter prediction signal as described above.

In addition, information indicating the inter prediction mode (normal inter mode in the above example) used to generate the prediction image is, for example, encoded as a prediction parameter.

It is to be noted that the MV candidate list may be also used as a list for use in another mode. In addition, the processes related to the MV candidate list may be applied to processes related to the list for use in another mode. The processes related to the MV candidate list include, for example, extraction or selection of an MV candidate from the MV candidate list, reordering of MV candidates, or deletion of an MV candidate.

[MV Derivation>Merge Mode]

The merge mode is an inter prediction mode for selecting an MV candidate from an MV candidate list as an MV of a current block, thereby deriving the MV.

FIG. 20 is a flow chart illustrating an example of inter prediction in merge mode.

First, inter predictor 126 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of encoded blocks temporally or spatially surrounding the current block (Step Sh_1). In other words, inter predictor 126 generates an MV candidate list.

Next, inter predictor 126 selects one MV candidate from the plurality of MV candidates obtained in Step Sh_1, thereby deriving an MV of the current block (Step Sh_2). At this time, inter predictor 126 encodes, in a stream, MV selection information for identifying the selected MV candidate.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Sh_3).

In addition, information indicating the inter prediction mode (merge mode in the above example) used to generate the prediction image and included in the encoded signal is, for example, encoded as a prediction parameter.

FIG. 21 is a conceptual diagram for illustrating one example of a motion vector derivation process of a current picture in merge mode.

First, an MV candidate list in which MV predictor candidates are registered is generated. Examples of MV predictor candidates include: spatially neighboring MV predictors which are MVs of a plurality of encoded blocks located spatially surrounding a current block; temporally neighboring MV predictors which are MVs of surrounding blocks on which the position of a current block in an encoded reference picture is projected; combined MV predictors which are MVs generated by combining the MV value of a spatially neighboring MV predictor and the MV of a temporally neighboring MV predictor; and a zero MV predictor which is an MV having a zero value.

Next, one MV predictor is selected from a plurality of MV predictors registered in an MV predictor list, and the selected MV predictor is determined as the MV of a current block.

Furthermore, the variable length encoder describes and encodes, in a stream, merge_idx which is a signal indicating which MV predictor has been selected.

It is to be noted that the MV predictors registered in the MV predictor list described in FIG. 21 are examples. The number of MV predictors may be different from the number of MV predictors in the diagram, the MV predictor list may be configured in such a manner that some of the kinds of the MV predictors in the diagram may not be included, or that one or more MV predictors other than the kinds of MV predictors in the diagram are included.

A final MV may be determined by performing a decoder motion vector refinement process (DMVR) to be described later using the MV of the current block derived in merge mode.

It is to be noted that the MV predictor candidates are MV candidates described above, and the MV predictor list is the MV candidate list described above. It is to be noted that the MV candidate list may be referred to as a candidate list. In addition, merge_idx is MV selection information.

[MV Derivation>FRUC Mode]

Motion information may be derived at the decoder side without being signaled from the encoder side. It is to be noted that, as described above, the merge mode defined in the H.265/HEVC standard may be used. In addition, for example, motion information may be derived by performing motion estimation at the decoder side. In an embodiment, at the decoder side, motion estimation is performed without using any pixel value in a current block.

Here, a mode for performing motion estimation at the decoder side is described. The mode for performing motion estimation at the decoder side may be referred to as a pattern matched motion vector derivation (PMMVD) mode, or a frame rate up-conversion (FRUC) mode.

One example of a FRUC process in the form of a flow chart is illustrated in FIG. 22. First, a list of a plurality of candidates each having a motion vector (MV) predictor (that is, an MV candidate list that may be also used as a merge list) is generated by referring to a motion vector in an encoded block which spatially or temporally neighbors a current block (Step Si_1). Next, a best MV candidate is selected from the plurality of MV candidates registered in the MV candidate list (Step Si_2). For example, the evaluation values of the respective MV candidates included in the MV candidate list are calculated, and one MV candidate is selected based on the evaluation values. Based on the selected motion vector candidates, a motion vector for the current block is then derived (Step Si_4). More specifically, for example, the selected motion vector candidate (best MV candidate) is derived directly as the motion vector for the current block. In addition, for example, the motion vector for the current block may be derived using pattern matching in a surrounding region of a position in a reference picture where the position in the reference picture corresponds to the selected motion vector candidate. In other words, estimation using the pattern matching and the evaluation values may be performed in the surrounding region of the best MV candidate, and when there is an MV that yields a better evaluation value, the best MV candidate may be updated to the MV that yields the better evaluation value, and the updated MV may be determined as the final MV for the current block. A configuration in which no such a process for updating the best MV candidate to the MV having a better evaluation value is performed is also possible.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the encoded reference picture (Step Si_5).

A similar process may be performed in units of a sub-block.

Evaluation values may be calculated according to various kinds of methods. For example, a comparison is made between a reconstructed image in a region in a reference picture corresponding to a motion vector and a reconstructed image in a determined region (the region may be, for example, a region in another reference picture or a region in a neighboring block of a current picture, as indicated below). The determined region may be predetermined.

The difference between the pixel values of the two reconstructed images may be used for an evaluation value of the motion vectors. It is to be noted that an evaluation value may be calculated using information other than the value of the difference.

Next, an example of pattern matching is described in detail. First, one MV candidate included in an MV candidate list (for example, a merge list) is selected as a start point of estimation by the pattern matching. For example, as the pattern matching, either a first pattern matching or a second pattern matching may be used. The first pattern matching and the second pattern matching are also referred to as bilateral matching and template matching, respectively.

[MV Derivation>FRUC>Bilateral Matching]

In the first pattern matching, pattern matching is performed between two blocks along a motion trajectory of a current block which are two blocks in different two reference pictures. Accordingly, in the first pattern matching, a region in another reference picture along the motion trajectory of the current block is used as a determined region for calculating the evaluation value of the above-described candidate. The determined region may be predetermined.

FIG. 23 is a conceptual diagram for illustrating one example of the first pattern matching (bilateral matching) between the two blocks in the two reference pictures along the motion trajectory. As illustrated in FIG. 23, in the first pattern matching, two motion vectors (MV0, MV1) are derived by estimating a pair which best matches among pairs in the two blocks in the two different reference pictures (Ref0, Ref1) which are the two blocks along the motion trajectory of the current block (Cur block). More specifically, a difference between the reconstructed image at a specified location in the first encoded reference picture (Ref0) specified by an MV candidate and the reconstructed image at a specified location in the second encoded reference picture (Ref1) specified by a symmetrical MV obtained by scaling the MV candidate at a display time interval is derived for the current block, and an evaluation value is calculated using the value of the obtained difference. It is possible to select, as the final MV, the MV candidate which yields the best evaluation value among the plurality of MV candidates, and which is likely to produce good results.

In the assumption of a continuous motion trajectory, the motion vectors (MV0, MV1) specifying the two reference blocks are proportional to temporal distances (TD0, TD1) between the current picture (Cur Pic) and the two reference pictures (Ref0, Ref1). For example, when the current picture is temporally located between the two reference pictures and the temporal distances from the current picture to the respective two reference pictures are equal to each other, mirror-symmetrical bi-directional motion vectors are derived in the first pattern matching.

[MV Derivation>FRUC>Template Matching]

In the second pattern matching (template matching), pattern matching is performed between a block in a reference picture and a template in the current picture (the template is a block neighboring the current block in the current picture (the neighboring block is, for example, an upper and/or left neighboring block(s))). Accordingly, in the second pattern matching, the block neighboring the current block in the current picture is used as the determined region for calculating the evaluation value of the above-described candidate.

FIG. 24 is a conceptual diagram for illustrating one example of pattern matching (template matching) between a template in a current picture and a block in a reference picture. As illustrated in FIG. 24, in the second pattern matching, the motion vector of the current block (Cur block) is derived by estimating, in the reference picture (Ref0), the block which best matches the block neighboring the current block in the current picture (Cur Pic). More specifically, it is possible that the difference between a reconstructed image in an encoded region which neighbors both left and above or either left or above and a reconstructed image which is in a corresponding region in the encoded reference picture (Ref0) and is specified by an MV candidate is derived, an evaluation value is calculated using the value of the obtained difference, and the MV candidate which yields the best evaluation value among a plurality of MV candidates is selected as the best MV candidate.

Such information indicating whether to apply the FRUC mode (referred to as, for example, a FRUC flag) may be signaled at the CU level. In addition, when the FRUC mode is applied (for example, when a FRUC flag is true), information indicating an applicable pattern matching method (either the first pattern matching or the second pattern matching) may be signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

[MV Derivation>Affine Mode]

Next, the affine mode for deriving a motion vector in units of a sub-block based on motion vectors of a plurality of neighboring blocks is described. This mode is also referred to as an affine motion compensation prediction mode.

FIG. 25A is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block based on motion vectors of a plurality of neighboring blocks. In FIG. 25A, the current block includes sixteen 4×4 sub-blocks. Here, motion vector V₀ at an upper-left corner control point in the current block is derived based on a motion vector of a neighboring block, and likewise, motion vector V₁ at an upper-right corner control point in the current block is derived based on a motion vector of a neighboring sub-block. Two motion vectors v₀ and v₁ may be projected according to an expression (1A) indicated below, and motion vectors (v_(x), v_(y)) for the respective sub-blocks in the current block may be derived.

$\begin{matrix} \left\lbrack {{Math}.1} \right\rbrack &  \\ \left\{ \begin{matrix} {v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\ {v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} - {\frac{\left( {v_{1x} - v_{0x}} \right)}{w}y} + v_{0y}}} \end{matrix} \right. & \left( {1A} \right) \end{matrix}$

Here, x and y indicate the horizontal position and the vertical position of the sub-block, respectively, and w indicates a determined weighting coefficient. The determined weighting coefficient may be predetermined.

Such information indicating the affine mode (for example, referred to as an affine flag) may be signaled at the CU level. It is to be noted that the signaling of the information indicating the affine mode does not necessarily need to be performed at the CU level, and may be performed at another level (for example, at the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

In addition, the affine mode may include several modes for different methods for deriving motion vectors at the upper-left and upper-right corner control points. For example, the affine mode include two modes which are the affine inter mode (also referred to as an affine normal inter mode) and the affine merge mode.

[MV Derivation>Affine Mode]

FIG. 25B is a conceptual diagram for illustrating one example of deriving a motion vector of each sub-block in affine mode in which three control points are used. In FIG. 25B, the current block includes sixteen 4×4 blocks. Here, motion vector V₀ at the upper-left corner control point for the current block is derived based on a motion vector of a neighboring block, and likewise, motion vector V₁ at the upper-right corner control point for the current block is derived based on a motion vector of a neighboring block, and motion vector V₂ at the lower-left corner control point for the current block is derived based on a motion vector of a neighboring block. Three motion vectors v₀, v₁, and v₂ may be projected according to an expression (1B) indicated below, and motion vectors (v_(x), v_(y)) for the respective sub-blocks in the current block may be derived.

$\begin{matrix} \left\lbrack {{Math}.2} \right\rbrack &  \\ \left\{ \begin{matrix} {v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{2x} - v_{0x}} \right)}{h}y} + v_{0x}}} \\ {v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} - {\frac{\left( {v_{2y} - v_{0y}} \right)}{h}y} + v_{0y}}} \end{matrix} \right. & \left( {1B} \right) \end{matrix}$

Here, x and y indicate the horizontal position and the vertical position of the center of the sub-block, respectively, w indicates the width of the current block, and h indicates the height of the current block.

Affine modes in which different numbers of control points (for example, two and three control points) are used may be switched and signaled at the CU level. It is to be noted that information indicating the number of control points in affine mode used at the CU level may be signaled at another level (for example, the sequence level, picture level, slice level, tile level, CTU level, or sub-block level).

In addition, such an affine mode in which three control points are used may include different methods for deriving motion vectors at the upper-left, upper-right, and lower-left corner control points. For example, the affine modes include two modes which are the affine inter mode (also referred to as the affine normal inter mode) and the affine merge mode.

[MV Derivation>Affine Merge Mode]

FIG. 26A, FIG. 26B, and FIG. 26C are conceptual diagrams for illustrating the affine merge mode.

As illustrated in FIG. 26A, in the affine merge mode, for example, motion vector predictors at respective control points of a current block are calculated based on a plurality of motion vectors corresponding to blocks encoded according to the affine mode among encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) which neighbor the current block. More specifically, encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) are checked in the listed order, and the first effective block encoded according to the affine mode is identified. Motion vector predictors at the control points of the current block are calculated based on a plurality of motion vectors corresponding to the identified block.

For example, as illustrated in FIG. 26B, when block A which neighbors to the left of the current block has been encoded according to an affine mode in which two control points are used, motion vectors v₃ and v₄ projected at the upper-left corner position and the upper-right corner position of the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃ and v₄.

For example, as illustrated in FIG. 26C, when block A which neighbors to the left of the current block has been encoded according to an affine mode in which three control points are used, motion vectors v₃, v₄, and v₅ projected at the upper-left corner position, the upper-right corner position, and the lower-left corner position of the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block, motion vector predictor v₁ at the upper-right corner control point of the current block, and motion vector predictor v₂ at the lower-left corner control point of the current block are then calculated from derived motion vectors v₃, v₄, and v₅.

It is to be noted that this method for deriving motion vector predictors may be used to derive motion vector predictors of the respective control points of the current block in Step Sj_1 in FIG. 29 described later.

FIG. 27 is a flow chart illustrating one example of the affine merge mode.

In affine merge mode as illustrated, first, inter predictor 126 derives MV predictors of respective control points of a current block (Step Sk_1). The control points are an upper-left corner point of the current block and an upper-right corner point of the current block as illustrated in FIG. 25A, or an upper-left corner point of the current block, an upper-right corner point of the current block, and a lower-left corner point of the current block as illustrated in FIG. 25B.

In other words, as illustrated in FIG. 26A, inter predictor 126 checks encoded block A (left), block B (upper), block C (upper-right), block D (lower-left), and block E (upper-left) in the listed order, and identifies the first effective block encoded according to the affine mode.

When block A is identified and block A has two control points, as illustrated in FIG. 26B, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block and motion vector v₁ at the upper-right corner control point of the current block from motion vectors v₃ and v₄ at the upper-left corner and the upper-right corner of the encoded block including block A. For example, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block and motion vector v₁ at the upper-right corner control point of the current block by projecting motion vectors v₃ and v₄ at the upper-left corner and the upper-right corner of the encoded block onto the current block.

Alternatively, when block A is identified and block A has three control points, as illustrated in FIG. 26C, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block, motion vector v₁ at the upper-right corner control point of the current block, and motion vector v₂ at the lower-left corner control point of the current block from motion vectors v₃, v₄, and v₅ at the upper-left corner, the upper-right corner, and the lower-left corner of the encoded block including block A. For example, inter predictor 126 calculates motion vector v₀ at the upper-left corner control point of the current block, motion vector v₁ at the upper-right corner control point of the current block, and motion vector v₂ at the lower-left corner control point of the current block by projecting motion vectors v₃, v₄, and v₅ at the upper-left corner, the upper-right corner, and the lower-left corner of the encoded block onto the current block.

Next, inter predictor 126 performs motion compensation of each of a plurality of sub-blocks included in the current block. In other words, inter predictor 126 calculates, for each of the plurality of sub-blocks, a motion vector of the sub-block as an affine MV, by using either (i) two motion vector predictors v₀ and v₁ and the expression (1A) described above or (ii) three motion vector predictors v₀, v₁, and v₂ and the expression (1B) described above (Step Sk_2). Inter predictor 126 then performs motion compensation of the sub-blocks using these affine MVs and encoded reference pictures (Step Sk_3). As a result, motion compensation of the current block is performed to generate a prediction image of the current block.

[MV Derivation>Affine Inter Mode]

FIG. 28A is a conceptual diagram for illustrating an affine inter mode in which two control points are used.

In the affine inter mode, as illustrated in FIG. 28A, a motion vector selected from motion vectors of encoded block A, block B, and block C which neighbor the current block is used as motion vector predictor v₀ at the upper-left corner control point of the current block. Likewise, a motion vector selected from motion vectors of encoded block D and block E which neighbor the current block is used as motion vector predictor v₁ at the upper-right corner control point of the current block.

FIG. 28B is a conceptual diagram for illustrating an affine inter mode in which three control points are used.

In the affine inter mode, as illustrated in FIG. 28B, a motion vector selected from motion vectors of encoded block A, block B, and block C which neighbor the current block is used as motion vector predictor v₀ at the upper-left corner control point of the current block. Likewise, a motion vector selected from motion vectors of encoded block D and block E which neighbor the current block is used as motion vector predictor v₁ at the upper-right corner control point of the current block. Furthermore, a motion vector selected from motion vectors of encoded block F and block G which neighbor the current block is used as motion vector predictor v₂ at the lower-left corner control point of the current block.

FIG. 29 is a flow chart illustrating one example of an affine inter mode.

In the affine inter mode as illustrated, first, inter predictor 126 derives MV predictors (v₀, v₁) or (v₀, v₁, v₂) of respective two or three control points of a current block (Step Sj_1). The control points are an upper-left corner point of the current block and an upper-right corner point of the current block as illustrated in FIG. 25A, or an upper-left corner point of the current block, an upper-right corner point of the current block, and a lower-left corner point of the current block as illustrated in FIG. 25B.

In other words, inter predictor 126 derives the motion vector predictors (v₀, v₁) or (v₀, v₁, v₂) of respective two or three control points of the current block by selecting motion vectors of any of the blocks among encoded blocks in the vicinity of the respective control points of the current block illustrated in either FIG. 28A or FIG. 28B. At this time, inter predictor 126 encodes, in a stream, motion vector predictor selection information for identifying the selected two motion vectors.

For example, inter predictor 126 may determine, using a cost evaluation or the like, the block from which a motion vector as a motion vector predictor at a control point is selected from among encoded blocks neighboring the current block, and may describe, in a bitstream, a flag indicating which motion vector predictor has been selected.

Next, inter predictor 126 performs motion estimation (Step Sj_3 and Sj_4) while updating a motion vector predictor selected or derived in Step Sj_1 (Step Sj_2). In other words, inter predictor 126 calculates, as an affine MV, a motion vector of each of sub-blocks which corresponds to an updated motion vector predictor, using either the expression (1A) or expression (1B) described above (Step Sj_3). Inter predictor 126 then performs motion compensation of the sub-blocks using these affine MVs and encoded reference pictures (Step Sj_4). As a result, for example, inter predictor 126 determines the motion vector predictor which yields the smallest cost as the motion vector at a control point in a motion estimation loop (Step Sj_5). At this time, inter predictor 126 further encodes, in the stream, the difference value between the determined MV and the motion vector predictor as an MV difference.

Lastly, inter predictor 126 generates a prediction image for the current block by performing motion compensation of the current block using the determined MV and the encoded reference picture (Step Sj_6).

[MV Derivation>Affine Inter Mode]

When affine modes in which different numbers of control points (for example, two and three control points) are used may be switched and signaled at the CU level, the number of control points in an encoded block and the number of control points in a current block may be different from each other. FIG. 30A and FIG. 30B are conceptual diagrams for illustrating methods for deriving motion vector predictors at control points when the number of control points in an encoded block and the number of control points in a current block are different from each other. For example, as illustrated in FIG. 30A, when a current block has three control points at the upper-left corner, the upper-right corner, and the lower-left corner, and block A which neighbors to the left of the current block has been encoded according to an affine mode in which two control points are used, motion vectors v₃ and v₄ projected at the upper-left corner position and the upper-right corner position in the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃ and v₄. Furthermore, motion vector predictor v₂ at the lower-left corner control point is calculated from derived motion vectors v₀ and v₁.

For example, as illustrated in FIG. 30B, when a current block has two control points at the upper-left corner and the upper-right corner, and block A which neighbors to the left of the current block has been encoded according to the affine mode in which three control points are used, motion vectors v₃, v₄, and v₅ projected at the upper-left corner position, the upper-right corner position, and the lower-left corner position in the encoded block including block A are derived. Motion vector predictor v₀ at the upper-left corner control point of the current block and motion vector predictor v₁ at the upper-right corner control point of the current block are then calculated from derived motion vectors v₃, v₄, and v₅.

It is to be noted that this method for deriving motion vector predictors may be used to derive motion vector predictors of the respective control points of the current block in Step Sj_1 in FIG. 29.

[MV Derivation>DMVR]

FIG. 31A is a flow chart illustrating a relationship between the merge mode and DMVR.

Inter predictor 126 derives a motion vector of a current block according to the merge mode (Step Sl_1). Next, inter predictor 126 determines whether to perform estimation of a motion vector, that is, motion estimation (Step Sl_2). Here, when determining not to perform motion estimation (No in Step S1_2), inter predictor 126 determines the motion vector derived in Step Sl_1 as the final motion vector for the current block (Step S1_4). In other words, in this case, the motion vector of the current block is determined according to the merge mode.

When determining to perform motion estimation in Step Sl_1 (Yes in Step S1_2), inter predictor 126 derives the final motion vector for the current block by estimating a surrounding region of the reference picture specified by the motion vector derived in Step Sl_1 (Step S1_3). In other words, in this case, the motion vector of the current block is determined according to the DMVR.

FIG. 31B is a conceptual diagram for illustrating one example of a DMVR process for determining an MV.

First, (for example, in merge mode) the best MVP which has been set to the current block is determined to be an MV candidate. A reference pixel is identified from a first reference picture (L0) which is an encoded picture in the L0 direction according to an MV candidate (L0). Likewise, a reference pixel is identified from a second reference picture (L1) which is an encoded picture in the L1 direction according to an MV candidate (L1). A template is generated by calculating an average of these reference pixels.

Next, each of the surrounding regions of MV candidates of the first reference picture (L0) and the second reference picture (L1) are estimated, and the MV which yields the smallest cost is determined to be the final MV. It is to be noted that the cost value may be calculated, for example, using a difference value between each of the pixel values in the template and a corresponding one of the pixel values in the estimation region, the values of MV candidates, etc.

It is to be noted that the processes, configurations, and operations described here typically are basically common between the encoder and a decoder to be described later.

Exactly the same example processes described here do not always need to be performed. Any process for enabling derivation of the final MV by estimation in surrounding regions of MV candidates may be used.

[Motion Compensation>BIO/OBMC]

Motion compensation involves a mode for generating a prediction image, and correcting the prediction image. The mode is, for example, BIO and OBMC to be described later.

FIG. 32 is a flow chart illustrating one example of generation of a prediction image.

Inter predictor 126 generates a prediction image (Step Sm_1), and corrects the prediction image, for example, according to any of the modes described above (Step Sm_2).

FIG. 33 is a flow chart illustrating another example of generation of a prediction image.

Inter predictor 126 determines a motion vector of a current block (Step Sn_1). Next, inter predictor 126 generates a prediction image (Step Sn_2), and determines whether to perform a correction process (Step Sn_3). Here, when determining to perform a correction process (Yes in Step Sn_3), inter predictor 126 generates the final prediction image by correcting the prediction image (Step Sn_4). When determining not to perform a correction process (No in Step Sn_3), inter predictor 126 outputs the prediction image as the final prediction image without correcting the prediction image (Step Sn_5).

In addition, motion compensation involves a mode for correcting a luminance of a prediction image when generating the prediction image. The mode is, for example, LIC to be described later.

FIG. 34 is a flow chart illustrating another example of generation of a prediction image.

Inter predictor 126 derives a motion vector of a current block (Step So_1). Next, inter predictor 126 determines whether to perform a luminance correction process (Step So_2). Here, when determining to perform a luminance correction process (Yes in Step So_2), inter predictor 126 generates the prediction image while performing a luminance correction process (Step So_3). In other words, the prediction image is generated using LIC. When determining not to perform a luminance correction process (No in Step So_2), inter predictor 126 generates a prediction image by performing normal motion compensation without performing a luminance correction process (Step So_4).

[Motion Compensation>OBMC]

It is to be noted that an inter prediction signal may be generated using motion information for a neighboring block in addition to motion information for the current block obtained from motion estimation. More specifically, the inter prediction signal may be generated in units of a sub-block in the current block by performing a weighted addition of a prediction signal based on motion information obtained from motion estimation (in the reference picture) and a prediction signal based on motion information for a neighboring block (in the current picture). Such inter prediction (motion compensation) is also referred to as overlapped block motion compensation (OBMC).

In OBMC mode, information indicating a sub-block size for OBMC (referred to as, for example, an OBMC block size) may be signaled at the sequence level. Moreover, information indicating whether to apply the OBMC mode (referred to as, for example, an OBMC flag) may be signaled at the CU level. It is to be noted that the signaling of such information does not necessarily need to be performed at the sequence level and CU level, and may be performed at another level (for example, at the picture level, slice level, tile level, CTU level, or sub-block level).

Examples of the OBMC mode will be described in further detail. FIGS. 35 and 36 are a flow chart and a conceptual diagram for illustrating an outline of a prediction image correction process performed by an OBMC process.

First, as illustrated in FIG. 36, a prediction image (Pred) is obtained through normal motion compensation using a motion vector (MV) assigned to the processing target (current) block. In FIG. 36, the arrow “MV” points a reference picture, and indicates what the current block of the current picture refers to in order to obtain a prediction image.

Next, a prediction image (Pred_L) is obtained by applying a motion vector (MV_L) which has been already derived for the encoded block neighboring to the left of the current block to the current block (re-using the motion vector for the current block). The motion vector (MV_L) is indicated by an arrow “MV_L” indicating a reference picture from a current block. A first correction of a prediction image is performed by overlapping two prediction images Pred and Pred_L. This provides an effect of blending the boundary between neighboring blocks.

Likewise, a prediction image (Pred_U) is obtained by applying a motion vector (MV_U) which has been already derived for the encoded block neighboring above the current block to the current block (re-using the motion vector for the current block). The motion vector (MV_U) is indicated by an arrow “MV_U” indicating a reference picture from a current block. A second correction of a prediction image is performed by overlapping the prediction image Pred_U to the prediction images (for example, Pred and Pred_L) on which the first correction has been performed. This provides an effect of blending the boundary between neighboring blocks. The prediction image obtained by the second correction is the one in which the boundary between the neighboring blocks has been blended (smoothed), and thus is the final prediction image of the current block.

Although the above example is a two-path correction method using left and upper neighboring blocks, it is to be noted that the correction method may be three- or more-path correction method using also the right neighboring block and/or the lower neighboring block.

It is to be noted that the region in which such overlapping is performed may be only part of a region near a block boundary instead of the pixel region of the entire block.

It is to be noted that the prediction image correction process according to OBMC for obtaining one prediction image Pred from one reference picture by overlapping additional prediction image Pred_L and Pred_U have been described above. However, when a prediction image is corrected based on a plurality of reference images, a similar process may be applied to each of the plurality of reference pictures. In such a case, after corrected prediction images are obtained from the respective reference pictures by performing OBMC image correction based on the plurality of reference pictures, the obtained corrected prediction images are further overlapped to obtain the final prediction image.

It is to be noted that, in OBMC, the unit of a current block may be the unit of a prediction block or the unit of a sub-block obtained by further splitting the prediction block.

One example of a method for determining whether to apply an OBMC process is a method for using an obmc_flag which is a signal indicating whether to apply an OBMC process. As one specific example, an encoder determines whether the current block belongs to a region having complicated motion. The encoder sets the obmc_flag to a value of “1” when the block belongs to a region having complicated motion and applies an OBMC process when encoding, and sets the obmc_flag to a value of “0” when the block does not belong to a region having complicated motion and encodes the block without applying an OBMC process. The decoder switches between application and non-application of an OBMC process by decoding the obmc_flag written in the stream (for example, a compressed sequence) and decoding the block by switching between the application and non-application of the OBMC process in accordance with the flag value.

Inter predictor 126 generates one rectangular prediction image for a rectangular current block in the above example. However, inter predictor 126 may generate a plurality of prediction images each having a shape different from a rectangle for the rectangular current block, and may combine the plurality of prediction images to generate the final rectangular prediction image. The shape different from a rectangle may be, for example, a triangle.

FIG. 37 is a conceptual diagram for illustrating generation of two triangular prediction images.

Inter predictor 126 generates a triangular prediction image by performing motion compensation of a first partition having a triangular shape in a current block by using a first MV of the first partition, to generate a triangular prediction image. Likewise, inter predictor 126 generates a triangular prediction image by performing motion compensation of a second partition having a triangular shape in a current block by using a second MV of the second partition, to generate a triangular prediction image. Inter predictor 126 then generates a prediction image having the same rectangular shape as the rectangular shape of the current block by combining these prediction images.

It is to be noted that, although the first partition and the second partition are triangles in the example illustrated in FIG. 37, the first partition and the second partition may be trapezoids, or other shapes different from each other. Furthermore, although the current block includes two partitions in the example illustrated in FIG. 37, the current block may include three or more partitions.

In addition, the first partition and the second partition may overlap with each other. In other words, the first partition and the second partition may include the same pixel region. In this case, a prediction image for a current block may be generated using a prediction image in the first partition and a prediction image in the second partition.

In addition, although an example in which a prediction image is generated for each of two partitions using inter prediction, a prediction image may be generated for at least one partition using intra prediction.

[Motion Compensation>BIO]

Next, a method for deriving a motion vector is described. First, a mode for deriving a motion vector based on a model assuming uniform linear motion will be described. This mode is also referred to as a bi-directional optical flow (BIO) mode.

FIG. 38 is a conceptual diagram for illustrating a model assuming uniform linear motion. In FIG. 38, (vx, vy) indicates a velocity vector, and τ0 and τ1 indicate temporal distances between a current picture (Cur Pic) and two reference pictures (Ref0, Ref1). (MVx0, MVy0) indicate motion vectors corresponding to reference picture Ref0, and (MVx1, MVy1) indicate motion vectors corresponding to reference picture Ref1.

Here, under the assumption of uniform linear motion exhibited by velocity vectors (v_(x), v_(y)), (MV_(x0), MV_(y0)) and (MV_(x1), MV_(y1)) are represented as (v_(x)τ₀, v_(y)τ₀) and (−v_(x)τ₁, −v_(y)τ₁), respectively, and the following optical flow equation (2) may be employed.

[MATH. 3]

∂I ^((k)) /∂t+v _(x) ∂I ^((l)) /∂x+v _(y) ∂I ^((k)) /∂y=0.   (2)

Here, I(k) indicates a motion-compensated luma value of reference picture k (k=0, 1). This optical flow equation shows that the sum of (i) the time derivative of the luma value, (ii) the product of the horizontal velocity and the horizontal component of the spatial gradient of a reference image, and (iii) the product of the vertical velocity and the vertical component of the spatial gradient of a reference image is equal to zero. A motion vector of each block obtained from, for example, a merge list may be corrected in units of a pixel, based on a combination of the optical flow equation and Hermite interpolation.

It is to be noted that a motion vector may be derived on the decoder side using a method other than deriving a motion vector based on a model assuming uniform linear motion. For example, a motion vector may be derived in units of a sub-block based on motion vectors of neighboring blocks.

[Motion Compensation>LIC]

Next, an example of a mode in which a prediction image (prediction) is generated by using a local illumination compensation (LIC) process will be described.

FIG. 39 is a conceptual diagram for illustrating one example of a prediction image generation method using a luminance correction process performed by a LIC process.

First, an MV is derived from an encoded reference picture, and a reference image corresponding to the current block is obtained.

Next, information indicating how the luma value changed between the reference picture and the current picture is extracted for the current block. This extraction is performed based on the luma pixel values for the encoded left neighboring reference region (surrounding reference region) and the encoded upper neighboring reference region (surrounding reference region), and the luma pixel value at the corresponding position in the reference picture specified by the derived MV. A luminance correction parameter is calculated by using the information indicating how the luma value changed.

The prediction image for the current block is generated by performing a luminance correction process in which the luminance correction parameter is applied to the reference image in the reference picture specified by the MV.

It is to be noted that the shape of the surrounding reference region illustrated in FIG. 39 is just one example; the surrounding reference region may have a different shape.

Moreover, although the process in which a prediction image is generated from a single reference picture has been described here, cases in which a prediction image is generated from a plurality of reference pictures can be described in the same manner. The prediction image may be generated after performing a luminance correction process of the reference images obtained from the reference pictures in the same manner as described above.

One example of a method for determining whether to apply a LIC process is a method for using a lic_flag which is a signal indicating whether to apply the LIC process. As one specific example, the encoder determines whether the current block belongs to a region having a luminance change. The encoder sets the lic_flag to a value of “1” when the block belongs to a region having a luminance change and applies a LIC process when encoding, and sets the lic_flag to a value of “0” when the block does not belong to a region having a luminance change and encodes the current block without applying a LIC process. The decoder may decode the lic_flag written in the stream and decode the current block by switching between application and non-application of a LIC process in accordance with the flag value.

One example of a different method of determining whether to apply a LIC process is a determining method in accordance with whether a LIC process was applied to a surrounding block. In one specific example, when the merge mode is used on the current block, whether a LIC process was applied in the encoding of the surrounding encoded block selected upon deriving the MV in the merge mode process is determined. According to the result, encoding is performed by switching between application and non-application of a LIC process. It is to be noted that, also in this example, the same processes are applied in processes at the decoder side.

An embodiment of the luminance correction (LIC) process described with reference to FIG. 39 is described in detail below.

First, inter predictor 126 derives a motion vector for obtaining a reference image corresponding to a current block to be encoded from a reference picture which is an encoded picture.

Next, inter predictor 126 extracts information indicating how the luma value of the reference picture has been changed to the luma value of the current picture, using the luma pixel value of an encoded surrounding reference region which neighbors to the left of or above the current block and the luma value in the corresponding position in the reference picture specified by a motion vector, and calculates a luminance correction parameter. For example, it is assumed that the luma pixel value of a given pixel in the surrounding reference region in the current picture is p0, and that the luma pixel value of the pixel corresponding to the given pixel in the surrounding reference region in the reference picture is p1. Inter predictor 126 calculates coefficients A and B for optimizing A×p1+B=p0 as the luminance correction parameter for a plurality of pixels in the surrounding reference region.

Next, inter predictor 126 performs a luminance correction process using the luminance correction parameter for the reference image in the reference picture specified by the motion vector, to generate a prediction image for the current block. For example, it is assumed that the luma pixel value in the reference image is p2, and that the luminance-corrected luma pixel value of the prediction image is p3. Inter predictor 126 generates the prediction image after being subjected to the luminance correction process by calculating A×p2+B=p3 for each of the pixels in the reference image.

It is to be noted that the shape of the surrounding reference region illustrated in FIG. 39 is one example; a different shape other than the shape of the surrounding reference region may be used. In addition, part of the surrounding reference region illustrated in FIG. 39 may be used. For example, a region having a determined number of pixels extracted from each of an upper neighboring pixel and a left neighboring pixel may be used as a surrounding reference region. The determined number of pixels may be predetermined.

In addition, the surrounding reference region is not limited to a region which neighbors the current block, and may be a region which does not neighbor the current block. In the example illustrated in FIG. 39, the surrounding reference region in the reference picture is a region specified by a motion vector in a current picture, from a surrounding reference region in the current picture. However, a region specified by another motion vector is also possible. For example, the other motion vector may be a motion vector in a surrounding reference region in the current picture.

Although operations performed by encoder 100 have been described here, it is to be noted that decoder 200 typically performs similar operations.

It is to be noted that the LIC process may be applied not only to the luma but also to chroma. At this time, a correction parameter may be derived individually for each of Y, Cb, and Cr, or a common correction parameter may be used for any of Y, Cb, and Cr.

In addition, the LIC process may be applied in units of a sub-block. For example, a correction parameter may be derived using a surrounding reference region in a current sub-block and a surrounding reference region in a reference sub-block in a reference picture specified by an MV of the current sub-block.

[Prediction Controller]

Inter predictor 128 selects one of an intra prediction signal (a signal output from intra predictor 124) and an inter prediction signal (a signal output from inter predictor 126), and outputs the selected signal to subtractor 104 and adder 116 as a prediction signal.

As illustrated in FIG. 1, in various kinds of encoder examples, prediction controller 128 may output a prediction parameter which is input to entropy encoder 110. Entropy encoder 110 may generate an encoded bitstream (or a sequence), based on the prediction parameter which is input from prediction controller 128 and quantized coefficients which are input from quantizer 108. The prediction parameter may be used in a decoder. The decoder may receive and decode the encoded bitstream, and perform the same processes as the prediction processes performed by intra predictor 124, inter predictor 126, and prediction controller 128. The prediction parameter may include (i) a selection prediction signal (for example, a motion vector, a prediction type, or a prediction mode used by intra predictor 124 or inter predictor 126), or (ii) an optional index, a flag, or a value which is based on a prediction process performed in each of intra predictor 124, inter predictor 126, and prediction controller 128, or which indicates the prediction process.

[Mounting Example of Encoder]

FIG. 40 is a block diagram illustrating a mounting example of encoder 100. Encoder 100 includes processor a1 and memory a2. For example, the plurality of constituent elements of encoder 100 illustrated in FIG. 1 are mounted on processor a1 and memory a2 illustrated in FIG. 40.

Processor a1 is circuitry which performs information processing and is accessible to memory a2. For example, processor a1 is dedicated or general electronic circuitry which encodes a video. Processor a1 may be a processor such as a CPU. In addition, processor a1 may be an aggregate of a plurality of electronic circuits. In addition, for example, processor a1 may take the roles of two or more constituent elements out of the plurality of constituent elements of encoder 100 illustrated in FIG. 1, etc.

Memory a2 is dedicated or general memory for storing information that is used by processor a1 to encode a video. Memory a2 may be electronic circuitry, and may be connected to processor a1. In addition, memory a2 may be included in processor a1. In addition, memory a2 may be an aggregate of a plurality of electronic circuits. In addition, memory a2 may be a magnetic disc, an optical disc, or the like, or may be represented as a storage, a recording medium, or the like. In addition, memory a2 may be non-volatile memory, or volatile memory.

For example, memory a2 may store a video to be encoded or a bitstream corresponding to an encoded video. In addition, memory a2 may store a program for causing processor a1 to encode a video.

In addition, for example, memory a2 may take the roles of two or more constituent elements for storing information out of the plurality of constituent elements of encoder 100 illustrated in FIG. 1, etc. For example, memory a2 may take the roles of block memory 118 and frame memory 122 illustrated in FIG. 1. More specifically, memory a2 may store a reconstructed block, a reconstructed picture, etc.

It is to be noted that, in encoder 100, all of the plurality of constituent elements indicated in FIG. 1, etc., may not be implemented, and all the processes described above may not be performed. Part of the constituent elements indicated in FIG. 1, etc., may be included in another device, or part of the processes described above may be performed by another device.

[Decoder]

Next, a decoder capable of decoding an encoded signal (encoded bitstream) output, for example, from encoder 100 described above will be described. FIG. 41 is a block diagram illustrating a functional configuration of decoder 200 according to an embodiment. Decoder 200 is a video decoder which decodes a video in units of a block.

As illustrated in FIG. 41, decoder 200 includes entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, block memory 210, loop filter 212, frame memory 214, intra predictor 216, inter predictor 218, and prediction controller 220.

Decoder 200 is implemented as, for example, a generic processor and memory. In this case, when a software program stored in the memory is executed by the processor, the processor functions as entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, loop filter 212, intra predictor 216, inter predictor 218, and prediction controller 220. Alternatively, decoder 200 may be implemented as one or more dedicated electronic circuits corresponding to entropy decoder 202, inverse quantizer 204, inverse transformer 206, adder 208, loop filter 212, intra predictor 216, inter predictor 218, and prediction controller 220.

Hereinafter, an overall flow of processes performed by decoder 200 is described, and then each of constituent elements included in decoder 200 will be described.

[Overall Flow of Decoding Process]

FIG. 42 is a flow chart illustrating one example of an overall decoding process performed by decoder 200.

First, entropy decoder 202 of decoder 200 identifies a splitting pattern of a block having a fixed size (for example, 128×128 pixels) (Step Sp_1). This splitting pattern is a splitting pattern selected by encoder 100. Decoder 200 then performs processes of Step Sp_2 to Sp_6 for each of a plurality of blocks of the splitting pattern.

In other words, entropy decoder 202 decodes (specifically, entropy-decodes) encoded quantized coefficients and a prediction parameter of a current block to be decoded (also referred to as a current block) (Step Sp_2).

Next, inverse quantizer 204 performs inverse quantization of the plurality of quantized coefficients and inverse transformer 206 performs inverse transform of the result, to restore a plurality of prediction residuals (that is, a difference block) (Step Sp_3).

Next, the prediction processor including all or part of intra predictor 216, inter predictor 218, and prediction controller 220 generates a prediction signal (also referred to as a prediction block) of the current block (Step Sp_4).

Next, adder 208 adds the prediction block to the difference block to generate a reconstructed image (also referred to as a decoded image block) of the current block (Step Sp_5).

When the reconstructed image is generated, loop filter 212 performs filtering of the reconstructed image (Step Sp_6).

Decoder 200 then determines whether decoding of the entire picture has been finished (Step Sp_7). When determining that the decoding has not yet been finished (No in Step Sp_7), decoder 200 repeatedly executes the processes starting with Step Sp_1.

As illustrated, the processes of Steps Sp_1 to Sp_7 are performed sequentially by decoder 200. Alternatively, two or more of the processes may be performed in parallel, the processing order of the two or more of the processes may be modified, etc.

[Entropy Decoder]

Entropy decoder 202 entropy decodes an encoded bitstream. More specifically, for example, entropy decoder 202 arithmetic decodes an encoded bitstream into a binary signal. Entropy decoder 202 then debinarizes the binary signal. With this, entropy decoder 202 outputs quantized coefficients of each block to inverse quantizer 204. Entropy decoder 202 may output a prediction parameter included in an encoded bitstream (see FIG. 1) to intra predictor 216, inter predictor 218, and prediction controller 220. Intra predictor 216, inter predictor 218, and prediction controller 220 in an embodiment are capable of executing the same prediction processes as those performed by intra predictor 124, inter predictor 126, and prediction controller 128 at the encoder side.

[Inverse Quantizer]

Inverse quantizer 204 inverse quantizes quantized coefficients of a block to be decoded (hereinafter referred to as a current block) which are inputs from entropy decoder 202. More specifically, inverse quantizer 204 inverse quantizes quantized coefficients of the current block, based on quantization parameters corresponding to the quantized coefficients. Inverse quantizer 204 then outputs the inverse quantized transform coefficients of the current block to inverse transformer 206.

[Inverse Transformer]

Inverse transformer 206 restores prediction errors by inverse transforming the transform coefficients which are inputs from inverse quantizer 204.

For example, when information parsed from an encoded bitstream indicates that EMT or AMT is to be applied (for example, when an AMT flag is true), inverse transformer 206 inverse transforms the transform coefficients of the current block based on information indicating the parsed transform type.

Moreover, for example, when information parsed from an encoded bitstream indicates that NSST is to be applied, inverse transformer 206 applies a secondary inverse transform to the transform coefficients.

[Adder]

Adder 208 reconstructs the current block by adding prediction errors which are inputs from inverse transformer 206 and prediction samples which are inputs from prediction controller 220. Adder 208 then outputs the reconstructed block to block memory 210 and loop filter 212.

[Block Memory]

Block memory 210 is storage for storing blocks in a picture to be decoded (hereinafter referred to as a current picture) and to be referred to in intra prediction. More specifically, block memory 210 stores reconstructed blocks output from adder 208.

[Loop Filter]

Loop filter 212 applies a loop filter to blocks reconstructed by adder 208, and outputs the filtered reconstructed blocks to frame memory 214, display device, etc.

When information indicating ON or OFF of an ALF parsed from an encoded bitstream indicates that an ALF is ON, one filter from among a plurality of filters is selected based on direction and activity of local gradients, and the selected filter is applied to the reconstructed block.

[Frame Memory]

Frame memory 214 is, for example, storage for storing reference pictures for use in inter prediction, and is also referred to as a frame buffer. More specifically, frame memory 214 stores a reconstructed block filtered by loop filter 212.

[Prediction Processor (Intra Predictor, Inter Predictor, Prediction Controller)]

FIG. 43 is a flow chart illustrating one example of a process performed by a prediction processor of decoder 200. It is to be noted that the prediction processor includes all or part of the following constituent elements: intra predictor 216; inter predictor 218; and prediction controller 220.

The prediction processor generates a prediction image of a current block (Step Sq_1). This prediction image is also referred to as a prediction signal or a prediction block. It is to be noted that the prediction signal is, for example, an intra prediction signal or an inter prediction signal. Specifically, the prediction processor generates the prediction image of the current block using a reconstructed image which has been already obtained through generation of a prediction block, generation of a difference block, generation of a coefficient block, restoring of a difference block, and generation of a decoded image block.

The reconstructed image may be, for example, an image in a reference picture, or an image of a decoded block in a current picture which is the picture including the current block. The decoded block in the current picture is, for example, a neighboring block of the current block.

FIG. 44 is a flow chart illustrating another example of a process performed by the prediction processor of decoder 200.

The prediction processor determines either a method or a mode for generating a prediction image (Step Sr_1). For example, the method or mode may be determined based on, for example, a prediction parameter, etc.

When determining a first method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the first method (Step Sr_2 a). When determining a second method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the second method (Step Sr_2 b). When determining a third method as a mode for generating a prediction image, the prediction processor generates a prediction image according to the third method (Step Sr_2 c).

The first method, the second method, and the third method may be mutually different methods for generating a prediction image. Each of the first to third methods may be an inter prediction method, an intra prediction method, or another prediction method. The above-described reconstructed image may be used in these prediction methods.

[Intra Predictor]

Intra predictor 216 generates a prediction signal (intra prediction signal) by performing intra prediction by referring to a block or blocks in the current picture stored in block memory 210, based on the intra prediction mode parsed from the encoded bitstream. More specifically, intra predictor 216 generates an intra prediction signal by performing intra prediction by referring to samples (for example, luma and/or chroma values) of a block or blocks neighboring the current block, and then outputs the intra prediction signal to prediction controller 220.

It is to be noted that when an intra prediction mode in which a luma block is referred to in intra prediction of a chroma block is selected, intra predictor 216 may predict the chroma component of the current block based on the luma component of the current block.

Moreover, when information parsed from an encoded bitstream indicates that PDPC is to be applied, intra predictor 216 corrects intra-predicted pixel values based on horizontal/vertical reference pixel gradients.

[Inter Predictor]

Inter predictor 218 predicts the current block by referring to a reference picture stored in frame memory 214. Inter prediction is performed in units of a current block or a sub-block (for example, a 4×4 block) in the current block. For example, inter predictor 218 generates an inter prediction signal of the current block or the sub-block by performing motion compensation by using motion information (for example, a motion vector) parsed from an encoded bitstream (for example, a prediction parameter output from entropy decoder 202), and outputs the inter prediction signal to prediction controller 220.

It is to be noted that when the information parsed from the encoded bitstream indicates that the OBMC mode is to be applied, inter predictor 218 generates the inter prediction signal using motion information of a neighboring block in addition to motion information of the current block obtained from motion estimation.

Moreover, when the information parsed from the encoded bitstream indicates that the FRUC mode is to be applied, inter predictor 218 derives motion information by performing motion estimation in accordance with the pattern matching method (bilateral matching or template matching) parsed from the encoded bitstream. Inter predictor 218 then performs motion compensation (prediction) using the derived motion information.

Moreover, when the BIO mode is to be applied, inter predictor 218 derives a motion vector based on a model assuming uniform linear motion. Moreover, when the information parsed from the encoded bitstream indicates that the affine motion compensation prediction mode is to be applied, inter predictor 218 derives a motion vector of each sub-block based on motion vectors of neighboring blocks.

[MV Derivation>Normal Inter Mode]

When information parsed from an encoded bitstream indicates that the normal inter mode is to be applied, inter predictor 218 derives an MV based on the information parsed from the encoded bitstream and performs motion compensation (prediction) using the MV.

FIG. 45 is a flow chart illustrating an example of inter prediction in normal inter mode in decoder 200.

Inter predictor 218 of decoder 200 performs motion compensation for each block. Inter predictor 218 obtains a plurality of MV candidates for a current block based on information such as MVs of a plurality of decoded blocks temporally or spatially surrounding the current block (Step Ss_1). In other words, inter predictor 218 generates an MV candidate list.

Next, inter predictor 218 extracts N (an integer of 2 or larger) MV candidates from the plurality of MV candidates obtained in Step Ss_1, as motion vector predictor candidates (also referred to as MV predictor candidates) according to a determined priority order (Step Ss_2). It is to be noted that the priority order may be determined in advance for each of the N MV predictor candidates.

Next, inter predictor 218 decodes motion vector predictor selection information from an input stream (that is, an encoded bitstream), and selects, one MV predictor candidate from the N MV predictor candidates using the decoded motion vector predictor selection information, as a motion vector (also referred to as an MV predictor) of the current block (Step Ss_3).

Next, inter predictor 218 decodes an MV difference from the input stream, and derives an MV for a current block by adding a difference value which is the decoded MV difference and a selected motion vector predictor (Step Ss_4).

Lastly, inter predictor 218 generates a prediction image for the current block by performing motion compensation of the current block using the derived MV and the decoded reference picture (Step Ss_5).

[Prediction Controller]

Prediction controller 220 selects either the intra prediction signal or the inter prediction signal, and outputs the selected prediction signal to adder 208. As a whole, the configurations, functions, and processes of prediction controller 220, intra predictor 216, and inter predictor 218 at the decoder side may correspond to the configurations, functions, and processes of prediction controller 128, intra predictor 124, and inter predictor 126 at the encoder side.

[Mounting Example of Decoder]

FIG. 46 is a block diagram illustrating a mounting example of decoder 200. Decoder 200 includes processor b1 and memory b2. For example, the plurality of constituent elements of decoder 200 illustrated in FIG. 41 are mounted on processor b1 and memory b2 illustrated in FIG. 46.

Processor b1 is circuitry which performs information processing and is accessible to memory b2. For example, processor b1 is dedicated or general electronic circuitry which decodes a video (that is, an encoded bitstream). Processor b1 may be a processor such as a CPU. In addition, processor b1 may be an aggregate of a plurality of electronic circuits. In addition, for example, processor b1 may take the roles of two or more constituent elements out of the plurality of constituent elements of decoder 200 illustrated in FIG. 41, etc.

Memory b2 is dedicated or general memory for storing information that is used by processor b1 to decode an encoded bitstream. Memory b2 may be electronic circuitry, and may be connected to processor b1. In addition, memory b2 may be included in processor b1. In addition, memory b2 may be an aggregate of a plurality of electronic circuits. In addition, memory b2 may be a magnetic disc, an optical disc, or the like, or may be represented as a storage, a recording medium, or the like. In addition, memory b2 may be a non-volatile memory, or a volatile memory.

For example, memory b2 may store a video or a bitstream. In addition, memory b2 may store a program for causing processor b1 to decode an encoded bitstream.

In addition, for example, memory b2 may take the roles of two or more constituent elements for storing information out of the plurality of constituent elements of decoder 200 illustrated in FIG. 41, etc. Specifically, memory b2 may take the roles of block memory 210 and frame memory 214 illustrated in FIG. 41. More specifically, memory b2 may store a reconstructed block, a reconstructed picture, etc.

It is to be noted that, in decoder 200, all of the plurality of constituent elements illustrated in FIG. 41, etc., may not be implemented, and all the processes described above may not be performed. Part of the constituent elements indicated in FIG. 41, etc., may be included in another device, or part of the processes described above may be performed by another device.

[Definitions of Terms]

The respective terms may be defined as indicated below as examples.

A picture is an array of luma samples in monochrome format or an array of luma samples and two corresponding arrays of chroma samples in 4:2:0, 4:2:2, and 4:4:4 color format. A picture may be either a frame or a field.

A frame is the composition of a top field and a bottom field, where sample rows 0, 2, 4, . . . originate from the top field and sample rows 1, 3, 5, . . . originate from the bottom field.

A slice is an integer number of coding tree units contained in one independent slice segment and all subsequent dependent slice segments (if any) that precede the next independent slice segment (if any) within the same access unit.

A tile is a rectangular region of coding tree blocks within a particular tile column and a particular tile row in a picture. A tile may be a rectangular region of the frame that is intended to be able to be decoded and encoded independently, although loop-filtering across tile edges may still be applied.

A block is an M×N (M-column by N-row) array of samples, or an M×N array of transform coefficients. A block may be a square or rectangular region of pixels including one Luma and two Chroma matrices.

A coding tree unit (CTU) may be a coding tree block of luma samples of a picture that has three sample arrays, or two corresponding coding tree blocks of chroma samples. Alternatively, a CTU may be a coding tree block of samples of one of a monochrome picture and a picture that is coded using three separate color planes and syntax structures used to code the samples. A super block may be a square block of 64×64 pixels that consists of either 1 or 2 mode info blocks or is recursively partitioned into four 32×32 blocks, which themselves can be further partitioned.

Embodiment 2

Encoder 100 according to the present embodiment has a configuration equivalent to the configuration described in Embodiment 1. Furthermore, quantizer 108, inverse quantizer 112, and entropy encoder 110 of encoder 100 according to the present embodiment have functions additional or alternative to the functions described in Embodiment 1. Likewise, decoder 200 according to the present embodiment has a configuration equivalent to the configuration described in Embodiment 1. Furthermore, inverse quantizer 204 and entropy decoder 202 of decoder 200 according to the present embodiment have functions additional or alternative to the functions described in Embodiment 1.

For example, quantizer 108 according to the present embodiment performs dependent quantization (DQ), and inverse quantizers 112 and 204 according to the present embodiment perform inverse quantization corresponding to the DQ. In addition, entropy encoder 110 according to the present embodiment performs arithmetic encoding on a quantized coefficient using a flag, and entropy decoder 202 performs arithmetic decoding on a quantized coefficient on which arithmetic encoding has been performed using a flag.

The first to third aspects described below are specific aspects of the processes performed by encoder 100 and decoder 200 according to the present embodiment.

[First Aspect]

(Outline of Coefficient Encoding)

Entropy encoder 110 of encoder 100 according to the present embodiment transforms the above-described quantized coefficient to be in a format in which at least one flag is used (hereinafter referred to as a flag format), and performs arithmetic encoding on the quantized coefficient in the format. It should be noted that a quantized coefficient is a value obtained as a result of performing transformation and quantization on a prediction residual generated by inter prediction or intra prediction. The quantized coefficient is also referred to as a residual coefficient. The quantized coefficient is also referred to simply as a coefficient in the description below.

Entropy encoder 110 transforms a coefficient to be in a flag format in which at least one of: a significant_flag (hereinafter referred to as a sig_flag); a parity_flag; a greater1_flag (hereinafter referred to as a gt1_flag); a greater2_flag (hereinafter referred to as a gt2_flag); and a remainder is used.

The sig_flag is a flag indicating whether a coefficient is 0 or not. For example, the sig_flag indicates 0 when the coefficient is 0, and indicates 1 when the coefficient is not 0.

The parity_flag is a flag used when the coefficient is not 0, and indicates whether the coefficient is even or odd. In other words, the parity_flag is a flag which indicates that the first bit of a coefficient (e.g., the least significant bit) is 0 or 1. For example, the parity_flag indicates 1 when a coefficient is even, and indicates 0 when a coefficient is odd. In addition, the parity_flag is used together with the sig_flag, and indicates a value from 1 to 2 in combination with the sig_flag.

The gt1_flag is a flag used when the coefficient is not 0, and indicates whether an absolute value of the coefficient is greater than or equal to 3, for example. For example, the gt1_flag indicates 1 when the absolute value of a coefficient is greater than or equal to 3, and indicates 0 when the absolute value of a coefficient is not greater than or equal to 3.

The gt2_flag is a flag used when the absolute value of a coefficient is greater than or equal to 3 (in other words, in the case where gt1_flag=1), and indicates whether the absolute value of the coefficient is greater than or equal to 5, for example. For example, the gt2_flag indicates 1 when the absolute value of a coefficient is greater than or equal to 5, and indicates 0 when the absolute value of a coefficient is not greater than or equal to 5.

The remainder is a value used for a coefficient of gt2_flag=1, and indicated by (AbsLevel−5)/2, for example. It should be noted that AbsLevel is an absolute value of a coefficient. In addition, the number of the value after the decimal point of (AbsLevel−5)/2 may be truncated.

Accordingly, entropy decoder 202 calculates AbsLevel by “AbsLevel=sig_flag+parity_flag+2*gt1_flag+2*gt2_flag+2*remainder.”

It should be noted that the parity_flag is not used according to the standard of H.265/HEVC. Accordingly, in entropy decoding, the AbsLevel is calculated by “AbsLevel=sig_flag+gt1_flag+gt2_flag+remainder.”

Here, the parity_flag may be used in the above-described DQ, for example.

FIG. 47 is a diagram for explaining an outline of dependent Quantization (DQ).

Quantizer 108 of encoder 100 switches between and uses two quantizers different from each other. It should be noted that these two quantizers respectively use two quantization methods different from each other, and thus it can be said that quantizer 108 switches between and uses two quantization methods different from each other.

The two quantizers are first quantizer Q0 and second quantizer Q1 as illustrated in FIG. 47. First quantizer Q0 uses an equal quantization width which is determined based on a quantization parameter, and second quantizer Q1 uses at least two quantization widths different from each other. In a specific example, as illustrated in FIG. FIG. 47, a quantization width used for the range between a numerical value “0” and a numerical value “1” and the range between a numerical value “0” and a numerical value “-1” is half of a quantization width used outside these ranges, in second quantizer Q1. For example, inverse quantizers 112 and 204 perform inverse quantization on numerical values “1,” “2,” and “3” included in a bitstream into “12,” “24,” and “36,” respectively, when first quantizer Q0 is used. Meanwhile, inverse quantizers 112 and 204 perform inverse quantization on numerical values “1,” “2,” and “3” included in a bitstream into “6,” “18,” and “30,” respectively, when second quantizer Q1 is used.

FIG. 48 and FIG. 49 are diagrams illustrating one example of state transition of quantizer 108. More specifically, FIG. 48 is a diagram which visually illustrates state transition. FIG. 49 is a diagram illustrating the state transition in a two-dimensional table format, and indicates a state before transition and a state after transition that is determined by a quantized coefficient.

Quantizer 108 can take four states. The four states are state=0, 1, 2, and 3. In the case where state=0 or 1, quantizer 108 performs quantization using first quantizer Q0, and in the case of state=2 or 3, quantizer 108 performs quantization using second quantizer Q1.

In the initial state, the state is, for example, state=0. At this time, quantizer 108 quantizes, using first quantizer Q0, a pre-quantization coefficient that is the first coefficient in scan order, and thereby calculates a quantized coefficient. It should be noted that the pre-quantization coefficient is a coefficient before quantization is performed thereon, and is the above-described transform coefficient. As a result, quantizer 108 transitions to state=0 when the first bit of quantized coefficient k is 0, and transitions to state=2 when the first bit of quantized coefficient k is 1. Accordingly, quantizer 108 calculates a new quantized coefficient k by quantizing a pre-quantization coefficient that is the next coefficient in scan order, using a quantizer corresponding to the state after the transition. As described above, quantizer 108, every time a new quantized coefficient k is obtained, transitions a state according to whether the first bit of the new quantized coefficient k is 0 or 1.

It should be noted that, in DQ, although quantizer 108 uses two quantizers, quantizer 108 may use three or more quantizers, and may perform state transition different from the state transition illustrated in FIG. 48 and FIG. 49.

In addition, the above-described parity flag indicates that the first bit of quantized coefficient k is 0 or 1. Accordingly, in DQ, quantizer 108 may determine a quantizer to be used for the next pre-quantization coefficient, according to the parity flag.

Furthermore, inverse quantizers 112 and 204 also perform state transition using a plurality of quantizers in DQ, in the same manner as quantizer 108.

FIG. 50 is a diagram illustrating one example of binarization of a remainder.

Entropy encoder 110 encodes a remainder using Golomb-Rice coding. In addition, entropy encoder 110 switches the encoding method of a remainder, using a rice parameter, for example. For example, a rice parameter can take three values, such as g=0, 1, and 2. It should be noted that g is a variable indicating a rice parameter. Accordingly, entropy encoder 110 selects an encoding method according to a value indicated by a rice parameter from among three encoding methods, and encodes a remainder using the selected encoding method. It should be noted that the encoding method may be referred to as a binarizing method.

In addition, entropy encoder 110 binarizes a remainder using a prefix and a suffix in Golomb-Rice coding. Rice coding is used when using the prefix, and unary coding and index Golomb code are used when using the suffix.

For example, entropy encoder 110 binarizes a remainder using a prefix without using a suffix when the rice parameter is g=0, as illustrated in FIG. 50. Meanwhile, entropy encoder 110 binarizes a remainder using a prefix and a suffix when the rice parameter is g=1 or 2.

In addition, in the example illustrated in FIG. 50, as the value of a remainder is smaller, the encoding method in the case of g=0 can binarize the remainder into a smaller number of bits than the other encoding methods. On the other hand, as the value of a remainder is greater, the encoding method in the case of g=2 can binarize the remainder into a smaller number of bits than the other encoding methods. In addition, when the value of a remainder in not small or great, the encoding method in the case of g=1 can binarize the remainder into a smaller number of bits than the other encoding methods.

It should be noted that, in the example illustrated in FIG. 50, the rice parameter c take three values. However, the rice parameter may take four or more values. In this case, entropy encoder 110 selects an encoding method according to the rice parameter from among four or more encoding methods (i.e., binarizing methods), and encodes a remainder using the selected encoding method.

It should be noted that entropy decoder 202 may switch the decoding method (specifically, a debinarizing method) according to a rice parameter, in the same manner as entropy encoder 110.

FIG. 51 is a diagram for describing a method of determining a rice parameter. More specifically, FIG. 51 indicates a current coefficient to be encoded (the black square indicated in FIG. 51) and five coefficients located around the current coefficient (the hatched squares indicated in FIG. 51) among coefficients included in a block (e.g., a transform unit).

For example, when encoding the current coefficient, entropy encoder 110 determines a rice parameter for the current coefficient, using the five coefficients (hereinafter referred to as surrounding coefficients) located around the current coefficient. The five surrounding coefficients include two coefficients horizontally arrayed to the right of the current coefficient, two coefficients vertically arrayed under the current coefficient, and one coefficient located to the lower right of the current coefficient. It should be noted that these five surrounding coefficients are encoded prior to encoding the current coefficient in encoding, and these five surrounding coefficients are decoded prior to decoding a current coefficient to be decoded (the same coefficient as the current coefficient to be encoded) in decoding.

Entropy encoder 110 calculates a sum_minus1 by sum_minus1=sum_abs−num_sig, for determining a rice parameter. The sum_abs is an absolute value of a sum of the five surrounding coefficients. The num_sig is the number of coefficients which are not 0 among the five surrounding coefficients. It should be noted that, the method of deriving a sum_minus1 described above is merely an example, and thus other methods may be used in deriving a sum_minus1. For example, the sum_minus1 may be derived by sum_minus1=sum_abs without using the num_sig, or another offset value may be used instead of the num_sig to derive the sum_minus1 by sum_minus1=sum_abs−offset value.

Through the calculation, when sum_minus1<12, entropy encoder 110 determines a rice parameter to be g=0. In addition, when 12≤sum_minus1<25, entropy encoder 110 determines a rice parameter to be g=1. In addition, when 25≤sum_minus1, entropy encoder 110 determines a rice parameter to be g=2. Entropy encoder 110 selects an encoding method corresponding to the rice parameter determined in the above-described manner, and performs Golomb-Rice coding on a remainder, i.e., (AbsLevel−5)/2, using the selected encoding method.

FIG. 52 is a diagram which indicates a code length of a binary signal obtained as a result of Golomb-Rice coding performed on a remainder.

For example, the code length of the binary signal obtained as a result of Golomb-Rice coding performed on a remainder=0 is: 1 when the rice parameter is g=0; 2 when the rice parameter is g=1; and 3 when the rice parameter is g=2. In addition, the code length of the binary signal obtained as a result of Golomb-Rice coding performed on a remainder=1 is: 2 when the rice parameter is g=0; 2 when the rice parameter is g=1; and 3 when the rice parameter is g=2. In addition, the code length of the binary signal obtained as a result of Golomb-Rice coding performed on a remainder=6 is: 7 when the rice parameter is g=0; 5 when the rice parameter is g=1; and 4 when the rice parameter is g=2.

Here, when sum_minus1<12, the above-described five surrounding coefficients are considered to each have a value of an average of approximately less than or equal to 3 to 4. As a result, there is a possibility that the current coefficient is close to and greater than the five surrounding coefficients, and thus the current coefficient is predicted to be 5 or 6. Accordingly, since a gt1_flag and a gt2_flag are used in the flag format of the current coefficient, a remainder of the coefficient is predicted to be a remainder=0. For example, in the example illustrated in FIG. 52, in the case where remainder=0, entropy encoder 110 selects g=0 as a rice parameter, in order to make the code length of the binary signal shortest.

In addition, when 12≤sum_minus1<25, the above-described five surrounding coefficients are considered to each have a value of an average of approximately 3 to 5. As a result, there is a possibility that the current coefficient is close to and greater than the five surrounding coefficients, and thus the current coefficient is predicted to be 7 or 8. Accordingly, since a gt1_flag and a gt2_flag are used in the flag format of the current coefficient, a remainder of the coefficient is predicted to be a remainder=1. For example, in the example illustrated in FIG. 52, in the case where a remainder=1, entropy encoder 110 selects g=1 as a rice parameter, in order to make the code length of the binary signal shortest.

In addition, when 25≤sum_minus1, the above-described five surrounding coefficients are considered to each have a value approximately greater than or equal to approximately 7. As a result, there is a possibility that the current coefficient is close to and greater than the five surrounding coefficients, and thus the current coefficient is predicted to be greater than or equal to 9. Accordingly, since a gt1_flag and a gt2_flag are used in the flag format of the current coefficient, a remainder of the coefficient is predicted to be a remainder≥2. For example, in the example illustrated in FIG. 52, in the case where a remainder≥2, entropy encoder 110 selects g=2 as a rice parameter, in order to make the code length of the binary signal shortest.

It should be noted that entropy decoder 202 is also capable of determining a rice parameter in the same manner as entropy encoder 110.

(First Example of First Aspect)

FIG. 53 is a flowchart illustrating overall processing operations of entropy encoder 110 according to a first example of the first aspect. It should be noted that the flowchart of FIG. 53 indicates the processing operations of entropy encoder 110 when, for example, the above-described DQ is used.

Entropy encoder 110 repeats the processes of Step S110 to S140 for each of the sub-blocks such that each of the coefficients in the sub-block is encoded. A sub-block is a block including 4×4 pixels obtained by further splitting the above-described transform unit, for example.

Specifically, first, entropy encoder 110 encodes, for each of the coefficients in a sub-block, a sig_flag of the coefficient, and encodes a parity_flag of the coefficient when the sig_flag is 1. In addition, entropy encoder 110, when the sig_flag is 1, encodes the gt1_flag of the coefficient based on determination of whether the AbsLevel of the coefficient is greater than or equal to 3 (Step S110).

Next, entropy encoder 110, for each of the coefficients in the sub-block, when the coefficient is greater than or equal to 3, encodes gt2_flag of the coefficient based on determination of whether the AbsLevel of the coefficient is greater than or equal to 5 (Step S120).

Next, entropy encoder 110, for each of the coefficients in the sub-block, encodes remainder=(AbsLevel−5)/2 of the coefficient based on determination of whether the AbsLevel of the coefficient is greater than or equal to 5 (Step S130).

Then, entropy encoder 110, for each of the coefficients in the sub-block, encodes a sign (plus or minus) of the coefficient when the coefficient is not 0 (Step S140). It should be noted that the sign may be encoded as sign_flag.

Entropy encoder 110, subsequent to performing the processes of Steps S110 to S140 on the sub-block, performs the processes of Steps S110 to S140 on other sub-blocks as well.

FIG. 54 is a flowchart illustrating one example of the detailed processing operation of Step S110 illustrated in FIG. 53.

Entropy encoder 110 repeats the processes of Step S111 to S117 for each of the coefficients in the sub-block.

First, entropy encoder 110 determines whether the AbsLevel of the current coefficient is AbsLevel≠0 (Step S111). Here, when determining that the AbsLevel of the current coefficient is not AbsLevel≠0 (No in Step S111), entropy encoder 110 encodes a sig_flag=0 for the coefficient (Step S112 b). On the other hand, when determining that the AbsLevel of the current coefficient is AbsLevel≠0 (Yes in Step S111), entropy encoder 110 encodes a sig_flag=1 for the coefficient (Step S112 a).

Next, entropy encoder 110 determines whether the first bit (the least significant bit) of the AbsLevel of the current coefficient is 1 (Step S113). Here, entropy encoder 110, when determining that the first bit is 1 (Yes in Step S113), encodes a parity_flag=0 for the coefficient (Step S114 a). On the other hand, when determining that the first bit is not 1 (No in Step S113), entropy encoder 110 encodes a parity_flag=1 for the coefficient (Step S114 b).

Next, entropy encoder 110 determines whether the AbsLevel of the current coefficient is greater than or equal to 3 (Step S115). Here, when determining that the AbsLevel is greater than or equal to 3 (Yes in Step S115), entropy encoder 110 encodes a gt1_flag=1 for the coefficient (Step S116 a). On the other hand, when determining that the AbsLevel is not greater than or equal to 3 (No in Step S115), entropy encoder 110 encodes a gt1_flag=0 for the coefficient (Step S116 b).

Then, entropy encoder 110 causes quantizer 108 and inverse quantizer 112 to update the state of DQ according to the current coefficient, i.e., the parity_flag (Step S117).

Entropy encoder 110, subsequent to performing the processes of Steps S111 to S117 on a coefficient included a sub-block, also performs the processes of Steps S111 to S117 in the same manner on the next coefficient included the sub-block. In this manner, for each of the coefficients included in the sub-block, at least one flag according to the coefficient among the sig_flag, the parity_flag, and the gt1_flag is encoded.

FIG. 55 is a flowchart illustrating one example of the detailed processing operation of Step S120 illustrated in FIG. 53.

Entropy encoder 110 repeats the processes of Step S121 to S123 b for each of the coefficients in the sub-block.

First, entropy encoder 110 determines whether the AbsLevel of the current coefficient is greater than or equal to 3 (Step S121). Here, when determining that the AbsLevel of the current coefficient is not greater than or equal to 3 (No in Step S121), entropy encoder 110 does not encode a gt2_flag for the coefficient. On the other hand, when determining that the AbsLevel of the current coefficient is greater than or equal to 3 (Yes in Step S121), entropy encoder 110 further determines whether the AbsLevel is greater than or equal to 5 (Step S122). Here, when determining that the AbsLevel is greater than or equal to 5 (Yes in Step S122), entropy encoder 110 encodes a gt2_flag=1 for the coefficient (Step S123 a). On the other hand, when determining that the AbsLevel is not greater than or equal to 5 (No in Step S122), entropy encoder 110 encodes a gt2_flag=0 for the coefficient (Step S123 b).

Entropy encoder 110, subsequent to performing the processes of Steps S121 to S123 b on a coefficient included a sub-block, also performs the processes of Steps S121 to S123 b in the same manner on the next coefficient included the sub-block. In this manner, the gt2_flag is encoded as necessary for each of the coefficients included in the sub-block.

FIG. 56 is a flowchart illustrating one example of the detailed processing operation of Step S130 illustrated in FIG. 53.

Entropy encoder 110 repeats the processes of Step S131 to S132 for each of the coefficients in the sub-block.

First, entropy encoder 110 determines whether the AbsLevel of the current coefficient is greater than or equal to 5 (Step S131). Here, when determining that the AbsLevel of the current coefficient is not greater than or equal to 5 (No in Step S131), entropy encoder 110 does not encode a remainder for the coefficient. On the other hand, when determining that the AbsLevel is greater than or equal to 5 (Yes in Step S131), entropy encoder 110 encodes a remainder for the coefficient (Step S132). Accordingly, entropy encoder 110 encodes (AbsLevel−5)/2 (Step S132).

Entropy encoder 110, subsequent to performing the processes of Steps S131 to S132 on a coefficient included a sub-block, also performs the processes of Steps S131 to S132 in the same manner on the next coefficient included the sub-block. In this manner, the remainder is encoded as necessary for each of the coefficients included in the sub-block.

FIG. 57 is a diagram illustrating syntax related to entropy encoding according to the first example of the first aspect. More specifically, FIG. 57 illustrates a syntax structure of a stream generated by the processes indicated in the flowcharts illustrated in FIG. 53 to FIG. 56.

Entropy encoder 110 encodes, for each of a plurality of sub-blocks, each of the coefficients included in the sub-block, according to the syntax illustrated in FIG. 57. It should be noted that sig_flag[n] and parity_flag[n] in FIG. 57 are a sig_flag and a parity_flag of the nth coefficient included in a sub-block. In addition, abs_gt1_flag[n] and abs_gt2_flag[n] in FIG. 57 are a gt1_flag and a gt2_flag of the nth coefficient included in a sub-block. In addition, abs_remainder[n] and sign_flag[n] in FIG. 57 are a remainder and a sign_flag of the nth coefficient included in a sub-block.

FIG. 58 is a diagram illustrating a specific example of a sub-block including 4×4 coefficients. FIG. 59 is a diagram illustrating a specific example indicating each of the coefficients in the sub-block illustrated in FIG. 58, in the flag format according to the first example of the first aspect. It should be noted that the coefficients are arrayed from left to right in scan order in FIG. 59.

Entropy encoder 110 scans the sub-block illustrated in FIG. 58. In other words, entropy encoder 110 obtains each of the coefficients in the sub-block in predetermined order (i.e., scan order). For example, entropy encoder 110 obtains each of the coefficients in order in a diagonal direction from a coefficient at the bottom right to a coefficient at the top left in a sub-block. In the example illustrated in FIG. 58, entropy encoder 110 obtains each of the coefficients in order of 1, 1, 0, 2, 3, 4, 7, 5, 4, 5, 3, 6, 10, 8, 10, and 20, as illustrated in FIG. 58. Then, entropy encoder 110 transforms, into a flag format, each of the coefficients in obtaining order of the coefficients.

More specifically, since the AbsLevel is “1” when a coefficient is “1,” entropy encoder 110 encodes the sig_flag=1, the parity_flag=0, and the gt1_flag=0 for the coefficient.

When a coefficient is “0,” entropy encoder 110 encodes the sig_flag=0 for the coefficient. In addition, since the AbsLevel is “4” when a coefficient is “4,” entropy encoder 110 encodes the sig_flag=1, the parity_flag=1, the gt1_flag=1, and the gt2_flag=0 for the coefficient. In addition, since the AbsLevel is “7” when a coefficient is “7,” entropy encoder 110 encodes the sig_flag=1, the parity_flag=0, the gt1_flag=1, the gt2_flag=1, and the remainder=1 for the coefficient.

In addition, entropy encoder 110 performs arithmetic encoding on these sig_flag, parity_flag, gt1_flag, gt2_flag, and remainder. For the arithmetic encoding, for example, context-based adaptive binary arithmetic coding (CABAC) is used. In addition, an adaptive variable symbol occurrence probability may be used for the sig_flag, the parity_flag, the gt1_flag, the gt1_flag, and the gt2_flag, and a fixed symbol occurrence probability may be used for the remainder. More specifically, entropy encoder 110 performs arithmetic encoding on a sig_flag, a parity_flag, a gt1_flag, and a gt2_flag, while updating a symbol occurrence probability by the CABAC. Meanwhile, as to a remainder, entropy encoder 110 determines the above-described rice parameter for the remainder, and binarizes the remainder using a binarizing method according to the rice parameter. Then, entropy encoder 110 performs arithmetic encoding on the binarized remainder, using a fixed symbol occurrence probability, by the bypass processing of the CABAC.

In addition, entropy decoder 202 according to the first example of the first aspect sequentially decodes the flags and remainder of each of the encoded coefficients including the syntax illustrated in FIG. 57. Then, entropy decoder 202 decodes, for each of the encoded coefficients, the encoded coefficient, by calculating the AbsLevel as described above, using the decoded flags and remainder, etc.

(Advantageous Effects of First Example of First Aspect)

With the first example of the first aspect as described above, it is possible to reduce a coding amount of the remainder, by using each of the flags such as the gt1_flag and the gt2_flag in encoding coefficients.

It should be noted that, in a coding unit or a transform unit, in general, a sub-block has more coefficients which are not 0 as the sub-block is located closer to a low frequency side (i.e., upper left side). In the example illustrated in FIG. 59, a gt1_flag, a gt2_flag, etc., are used for a large number of coefficients included in a sub-block. In addition, when a sub-block includes a large number of coefficients having values greater than or equal to 3, there is a possibility that a coding amount of the sub-block increases due to the gt1_flag and the gt2_flag.

In addition, when arithmetic encoding is performed on each flag while a symbol occurrence probability is updated by the CABAC, a processing load is higher than when arithmetic encoding is performed by the bypass processing. Accordingly, when arithmetic encoding is performed on each flag while a symbol occurrence probability is updated by the CABAC, a processing load increases as the number of the flags is greater. Thus, the number of these flags may be limited.

(Second Example of First Aspect)

FIG. 60 is a flowchart illustrating overall processing operations of entropy encoder 110 according to a second example of the first aspect.

In the second example of the first aspect, unlike the first example, a total number of flags “gt1_flag” and a total number of flags “gt2_flag” are respectively limited. For example, a total number of flags “gt1_flag” is limited up to n_1, and a total number of flags “gt2_flag” is limited up to n_2. For example, n_1 is an integer which satisfies 1≤n_1≤16, and n_2 is an integer which satisfies 1≤n_2≤16.

For example, as illustrated in FIG. 60, entropy encoder 110 repeats the processes of Step S210 to S230 and S140 for each of the sub-blocks such that each of the coefficients in the sub-block is encoded.

Specifically, first, entropy encoder 110 encodes, for each of the coefficients in a sub-block, a sig_flag of the coefficient, and encodes a parity_flag of the coefficient when the sig_flag is 1. In addition, entropy encoder 110, when the coefficient is a coefficient which is not 0 and is at or before the n_1th position, encodes a gt1_flag of the coefficient based on determination of whether the AbsLevel of the coefficient is greater than or equal to 3 (Step S210). It should be noted that the coefficient which is not 0 and is at or before the n_1th position is the n_1th coefficient or a coefficient located before the n_1th coefficient in scan order, among the coefficients which are not 0 and are included in a sub-block.

Next, entropy encoder 110, for each of the coefficients in the sub-block, when the coefficient is a coefficient which has the AbsLevel greater than or equal to 3 and is at or before the n_2th position, encodes a gt2_flag of the coefficient based on determination of whether the AbsLevel of the coefficient is greater than or equal to 5 (Step S220). It should be noted that the coefficient which has the AbsLevel greater than or equal to 3 and is at or before the n_2th position is the n_2th coefficient or a coefficient located before the n_2th coefficient in scan order, among the coefficients which have the AbsLevel greater than or equal to 3 and are included in a sub-block.

Next, entropy encoder 110, for each of the coefficients in the sub-block, when the AbsLevel of the coefficient is greater than or equal to a baseLevel, encodes remainder=(AbsLevel−baseLevel)/2 (Step S230). The baseLevel is a value which varies according to the number of use of each of the gt1_flag and the gt2_flag. For example, the initial value of the baseLevel is 5. In addition, the initial value is updated from 5 to 3 when n_2 number of the flags “gt2_flag” are used, and then is updated from 3 to 1 when n_1 (e.g., n_1>n_2) number of the flags “gt1_flag” are used.

Then, entropy encoder 110, for each of the coefficients in the sub-block, encodes a sign (plus or minus) of the coefficient when the coefficient is not 0 (Step S140).

Entropy encoder 110, subsequent to performing the processes of Steps S210 to S230 and S140 on the sub-block, performs the processes of Steps S210 to S230 and S140 in the same manner on the other sub-blocks

FIG. 61 is a flowchart illustrating one example of the detailed processing operation of Step S210 illustrated in FIG. 60. It should be noted that the flowchart illustrated in FIG. 61 includes Steps S111 to S117 of the flowchart illustrated in FIG. 54, and further includes Step S211.

In other words, entropy encoder 110 repeats the processes of Step S111 to S117, and S211 for each of the coefficients in the sub-block.

More specifically, entropy encoder 110 performs the processes of Step S111 to 114 b in the same manner as in the first example described above. Subsequently, entropy encoder 110 determines whether current coefficient a is a coefficient which is not 0 and is at or before the n_1th position (Step S211). Here, when it is determined that current coefficient a is the coefficient which is not 0 and is at or before the n_1th position (Yes in Step S211), entropy encoder 110 performs the processes of Steps S115 to S117 in the same manner as in the first example described above. On the other hand, when it is determined that current coefficient a is not the coefficient which is not 0 and is at or before the n_1th position (No in Step S211), entropy encoder 110 performs the processes of Step S117 without performing the processed of Steps S115 to S116 b. In other words, in the first example, entropy encoder 110 uses the gt1_flag for all of the coefficients which are not 0 in the sub-block. However, in the second example, in the case where the gt1_flag has been used n_1 times, entropy encoder 110, in encoding a coefficient which is not 0, does not use the gt1_flag for the coefficient.

FIG. 62 is a flowchart illustrating one example of the detailed processing operation of Step S220 illustrated in FIG. 60. It should be noted that the flowchart illustrated in FIG. 62 includes Steps S122 to S123 b of the flowchart illustrated in FIG. 55, and further includes Step S221 instead of Step S121.

In other words, entropy encoder 110 repeats the processes of Step 5221 and Step S122 to S123 b for each of the coefficients in the sub-block.

More specifically, entropy encoder 110 determines whether current coefficient a is a coefficient which satisfies AbsLevel≥3 and is at or before the n_2th position (Step S221). Here, when determining that coefficient a is not a coefficient which satisfies AbsLevel≥3 and is at or before the n_2th position (No in Step S221), entropy encoder 110 does not encode a gt2_flag for coefficient a. On the other hand, when determining that coefficient a is a coefficient which satisfies AbsLevel≥3 and is at or before the n_2th position (Yes in Step S221), entropy encoder 110 determines whether the AbsLevel is greater than or equal to 5 (Step S122). Here, when determining that the AbsLevel is greater than or equal to 5 (Yes in Step S122), entropy encoder 110 encodes a gt2_flag=1 for the coefficient (Step S123 a). On the other hand, when determining that the AbsLevel is not greater than or equal to 5 (No in Step S122), entropy encoder 110 encodes a gt2_flag=0 for the coefficient (Step S123 b).

Entropy encoder 110, subsequent to performing the processes of Step S221 and Steps S122 to S123 b on a coefficient included a sub-block, also performs the processes of Step S221 and Steps S122 to S123 b in the same manner on the next coefficient included the sub-block. In this manner, the gt2_flag is encoded as necessary for each of the coefficients included in the sub-block.

FIG. 63 is a flowchart illustrating one example of the detailed processing operation of Step S230 illustrated in FIG. 60.

First, entropy encoder 110 sets the baseLevel to 5 (Step S231). Then, entropy encoder 110 repeats the processes of Step S232 to S236 for each of the coefficients in the sub-block.

More specifically, entropy encoder 110 determines whether n_1 number of the flags “gt1_flag” are used for coefficients located prior to current coefficient a in scan order in the sub-block (Step S232). Here, when it is determined that n_1 number of the flags “gt1_flag” are used (Yes in Step S232), entropy encoder 110 updates the baseLevel to 1 (Step S233).

On the other hand, when it is determined that n_1 number of the flags “gt1_flag” are not used (No in Step S232), entropy encoder 110 further performs determination regarding a total number of the flags “gt2_flag.” More specifically, entropy encoder 110 determines whether n_2 number of the flags “gt2_flag” are used for coefficients located prior to current coefficient a in scan order in the sub-block (Step S234). Here, when it is determined that n_2 number of the flags “gt2_flag” are used (Yes in Step S234), entropy encoder 110 updates the baseLevel to 3 (Step S235).

On the other hand, when it is determined that n_2 number of the flags “gt2_flag” are not used (No in Step S234), entropy encoder 110 encodes the remainder for coefficient a (Step S236). In addition, entropy encoder 110 also encodes the remainder for coefficient a after the processes of Steps S233 and S235 are performed (S236). More specifically, entropy encoder 110 encodes (AbsLevel−baseLevel)/2. It should be noted that the remainder is encoded when AbsLevel≥baseLevel is satisfied. In addition, when none of the processes of Steps S233 and S235 is performed, the baseLevel is 5. In addition, the baseLevel is 1 when the process of Step S233 is performed, and the baseLevel is 3 when the process of Step S235 is performed. It should be noted that, in the flowchart illustrated in FIGS. 63, n_1 and n_2 may satisfy the relationship of n_1>n_2.

Entropy encoder 110, subsequent to performing the processes of Steps S232 to S236 on a coefficient included a sub-block, also performs the processes of Steps S232 to S236 in the same manner on the next coefficient included the sub-block. In this manner, a remainder is encoded as necessary for each of the coefficients included in the sub-block.

FIG. 64 is a diagram illustrating syntax related to entropy encoding according to the second example of the first aspect. More specifically, FIG. 64 illustrates a syntax structure of a stream generated by the processes indicated in the flowcharts illustrated in FIG. 60 to FIG. 63.

Entropy encoder 110 encodes, for each of a plurality of sub-blocks, each of the coefficients included in the sub-block, according to the syntax illustrated in FIG. 64.

Here, the syntax illustrated in FIG. 64 further includes setting or updating of two counters and setting or updating of the baseLevel, in addition to the syntax illustrated in FIG. 57. The two counters are numNonZero and numUpper3. The numNonZero is initialized to 0, and incremented when the sig_flag[n] is 1. When the sig_flag[n] is 1 and the numNonZero is less than or equal to n_1, the abs_gt1_flag[n] is encoded. The numUpper3 is initialize to 0. Then, when the abs_gt1_flag[n] is 1 and the numUpper3 is less than or equal to n_2, the abs_gt2_flag[n] is encoded, and the numUpper3 is incremented.

In addition, in encoding of the remainder, first, each of the numNonZero and the numUpper3 is initialized to 0, and the baseLevel is initialized to 5. Then, when the AbsLevel[n] is not 0, the numNonZero is incremented. Furthermore, when absLevel[n] is greater than or equal to 3, the numUpper3 is incremented. It should be noted that the absLevel[n] is the AbsLevel of the nth coefficient. When the absLevel[n] is greater than or equal to the baseLevel, (AbsLevel−baseLevel)/2 of the nth coefficient is encoded as abs remainder[n]. Then, when the numNonZero is greater than or equal to n_1, the baseLevel is updated to 1. Moreover, when the baseLevel is 5 and the numUpper3 is greater than or equal to n_2, the baseLevel is updated to 3.

FIG. 65 is a diagram illustrating a specific example indicating each of the coefficients in the sub-block illustrated in FIG. 58, in the flag format according to the second example of the first aspect. It should be noted that the coefficients are arrayed from left to right in scan order in FIG. 65.

In the example illustrated in FIGS. 65, n_1=8, and n_2=1. Accordingly, the gt2_flag is used for a coefficient which is the first in scan order and of which AbsLevel≥3, and is not used for the other coefficients located after the coefficient. In addition, the gt1_flag is used for the first 8 coefficients in scan order each of which is not 0, and is not used for the other coefficients located thereafter. In addition, although the baseLevel is set to 5 in the initial state, the baseLevel is updated to 3 when the gt2_flag becomes unavailable, and updated to 1 when the gt1_flag becomes unavailable. Then, using the baseLevel updated as described above, the remainder is calculated by (AbsLevel−baseLevel)/2 to be encoded.

In addition, entropy decoder 202 according to the second example of the first aspect sequentially decodes the encoded flags and the remainder of each of the coefficients including the syntax illustrated in FIG. 64. Then, entropy decoder 202 decodes, for each of the encoded coefficients, the encoded coefficient, by calculating the AbsLevel as described above, using the decoded flags and remainder, etc.

(Advantageous Effects of Second Example of First Aspect)

In the second example as described above, a total number of flags (for example, the gt1_flag or the gt2_flag) used for the coefficients in the sub-block is limited. Accordingly, it is possible to reduce the coding amount of the flags.

More specifically, in the example illustrated in FIG. 65, a total number of the flags “gt1_flag” and a total number of the flags “gt2_flag” are limited to 8 and 1, respectively. Accordingly, after 8 flags “gt1_flag” are used, the gt1_flag is not used for a coefficient even when the coefficient is not 0. Likewise, after one flag “gt2_flag” is used, the gt2_flag is not used for a coefficient even when the AbsLevel of the coefficient is greater than or equal to 3. As a result, in the second example, it is possible to reduce each of the total number of flags “gt1_flag” generated and the total number of flags “gt2_flag” generated compared to the first example (for example, the example illustrated in FIG. 59). Accordingly, it is possible to reduce the coding amount of these flags. In addition, when the CABAC of variable symbol occurrence probability is used for encoding the gt1_flag and the gt2_flag, it is possible to reduce processing load of the encoding. In other words, the CABAC of variable symbol occurrence probability involves a higher processing load than a processing load of the bypass processing of the CABAC. However, in the second example, it is possible to reduce a total number of flags applied in the CABAC of the variable symbol occurrence probability. Accordingly, it is possible to further reduce the processing load than the first example. In other words, in the second example, it is possible to reduce both of the coding amount of coefficients and the processing load in encoding coefficients.

It should be noted that, in the second example, in FIG. 65, the maximum number of the flags “gt1_flag” used is n_1=8, and the maximum number of the flags “gt2_flag” used is n_2=1. However, the maximum number of the flags is not limited to these examples, and may be other values. In addition, the maximum number n_1 and the maximum number n_2 may be predetermined fixed values, or may be set or updated as appropriate. In other words, entropy encoder 110 may adaptively determine each of the maximum number n_1 and the maximum number n_2.

For example, in encoding each of the coefficients in the sub-block as described above, a specific flag for these coefficients; that is, flags of specific types other than the gt1_flag and the gt2_flag are encoded prior to the other flags. It should be noted that flags of specific types may include, for example, at least one of the sig_flag and the parity_flag. The gt1_flag for each of the coefficients is encoded subsequent to the flags of the specific types, and the gt2_flag for each of the coefficients is encoded subsequent to the gt1_flag. In such a case, entropy encoder 110 may determine the maximum number n_1 as a value which depends on a total number M of the flags of the specific types. Alternatively, entropy encoder 110 may determine the maximum number n_1 as a value which depends on a total number Ma of flags each of which indicates a specific value such as 0 or 1, among the flags of the specific type. In addition, entropy encoder 110 may determine the maximum number n_2 as a value which depends on a total number N of at least one of the flags of the specific types and the “gt1_flag.” Alternatively, entropy encoder 110 may determine the maximum number n_2 as a value which depends on a total number Na of flags each of which indicates a specific value such as 0 or 1, among at least one of the flags of the specific types and flags gt1_flag. It should be noted that each of the above-described total number of flags M, Ma, N, and Na may be a total number of flags which have already been encoded.

It should be noted that, in the second example, the method in which the gt1_flag and the gt2_flag are not encoded when the flags have reached the maximum number. However, the present disclosure is not limited to these flags. For example, even when a flag is other than the gt1_flag and the gt2_flag, whether or not to encode the flag may be switched using an equivalent method, as long as the flag is related to encoding of an absolute value of a coefficient and to be encoded using the CABAC that involves updating a symbol occurrence probability.

[Second Aspect]

In the second example of the first aspect described above, the number of flags “gt1_flag” used is limited to less than or equal to the maximum number n_1, and the number of flags “gt2_flag” used is limited to less than or equal to the maximum number n_2. In the second aspect, n_2=0. In other words, the gt2_flag is not used in the second aspect.

FIG. 66 is a flowchart illustrating overall processing operations of entropy encoder 110 according to the second aspect.

Entropy encoder 110 repeats the processes of Steps S210, S330, and S140 for each of the sub-blocks such that each of the coefficients in the sub-block is encoded.

Specifically, first, entropy encoder 110 encodes, for each of the coefficients in a sub-block, a sig_flag of the coefficient, and encodes a parity_flag of the coefficient when the sig_flag is 1. In addition, entropy encoder 110, when the coefficient is a coefficient which is not 0 and is at or before the n_1th position, encodes a gt1_flag of the coefficient based on determination of whether the AbsLevel of the coefficient is greater than or equal to 3 (Step S210)

Next, entropy encoder 110, for each of the coefficients in the sub-block, when the AbsLevel of the coefficient is greater than or equal to a baseLevel, encodes remainder=(AbsLevel−baseLevel)/2 (Step S330). In the second aspect, the baseLevel is a value which varies according to the number of the flags “gt1_flag” used. For example, the initial value of the baseLevel is 3. In addition, the baseLevel is updated from 3 to 1 when n_1 number of the flags “gt1_flag” are used.

Then, entropy encoder 110, for each of the coefficients in the sub-block, encodes a sign (plus or minus) of the coefficient when the coefficient is not 0 (Step S140).

Entropy encoder 110, subsequent to performing the processes of Steps S210, S330, and S140 on the sub-block, performs the processes of Steps S210, S330, and S140 in the same manner on the other sub-block. It should be noted that the process of Step S210 is performed according to the flowchart illustrated in FIG. 61.

FIG. 67 is a flowchart illustrating one example of the detailed processing operation of Step S330 illustrated in FIG. 66.

First, entropy encoder 110 sets the baseLevel to 3 (Step S235). Then, entropy encoder 110 repeats the processes of Steps S232, S233, and S236 for each of the coefficients in the sub-block.

More specifically, entropy encoder 110 determines whether n_1 number of the flags “gt1_flag” are used for coefficients located prior to current coefficient a in scan order in the sub-block (Step S232). Here, when it is determined that n_1 number of the flags “gt1_flag” are used (Yes in Step S232), entropy encoder 110 updates the baseLevel to 1 (Step S233).

On the other hand, when it is determined that n_1 number of the flags “gt1_flag” are not used (No in Step S232), entropy encoder 110 encodes the remainder for coefficient a (Step S236). Entropy encoder 110 also encodes the remainder for coefficient a after the process of Step S233 was performed (Step S236). More specifically, entropy encoder 110 encodes (AbsLevel−baseLevel)/2. It should be noted that the remainder is encoded when AbsLevel≥baseLevel is satisfied. In addition, the baseLevel is 3 when the process of Step S233 is not performed, and the baseLevel is 1 when the process of Step S233 is performed.

Entropy encoder 110, subsequent to performing the processes of Steps S232, S233 and S236 on a coefficient included a sub-block, also performs the processes of Steps S232, S233 and S236 in the same manner on the next coefficient included the sub-block. In this manner, a remainder is encoded as necessary for each of the coefficients included in the sub-block.

FIG. 68 is a diagram illustrating syntax related to entropy encoding according to the second aspect. More specifically, FIG. 68 illustrates a syntax structure of a stream generated by the processes indicated by the flowcharts illustrated in FIG. 61, FIG. 66, and FIG. 67.

Entropy encoder 110 encodes, for each of a plurality of sub-blocks, each of the coefficients included in the sub-block, according to the syntax illustrated in FIG. 68.

Here, as compared to the syntax illustrated in FIG. 64, the syntax illustrated in FIG. 68 does not include setting and updating of the numUpper3 and encoding of the gt2_flag. Furthermore, in encoding of the remainder, unlike the syntax illustrated in FIG. 64, the baseLevel is initialized to 3.

FIG. 69 is a diagram illustrating a specific example indicating each of the coefficients included in the sub-block illustrated in FIG. 58, in the flag format according to the second aspect. It should be noted that the coefficients are arrayed from left to right in scan order in FIG. 69.

In the example illustrated in FIG. 69, n_1=16. Accordingly, the gt1_flag is used for the first 16 coefficients in scan order each of which is not 0, and is not used for coefficients located thereafter. In addition, although the baseLevel is set to 3 in the initial state, the baseLevel is updated to 1 when the gt1_flag becomes unavailable. Then, using the baseLevel updated as described above, the remainder is calculated by (AbsLevel−baseLevel)/2 to be encoded.

In addition, entropy decoder 202 according to the second aspect sequentially decodes the encoded flags and the remainder of each of the coefficients including the syntax illustrated in FIG. 68. Then, entropy decoder 202 decodes, for each of the encoded coefficients, the encoded coefficient, by calculating AbsLevel as described above, using the decoded flags and remainder, etc.

(Advantageous Effects of Second Aspect)

In the second aspect, the gt2_flag is not used. With this, it is possible to reduce the coding amount of flags and reduce the processing load. In addition, in the same manner as in the second example of the first aspect, since the total number of the flags “gt1_flag” is limited to less than or equal to n_1, it is possible to further reduce the processing load.

More specifically, in the example illustrated in FIG. 69, the gt2_flag is not used, and the total number of the flags “gt1_flag” are limited to less than or equal to 16. Accordingly, after 16 flags “gt1_flag” are used, the gt1_flag is not used for a coefficient even when the coefficient is not 0. In addition, in the same manner as in the second example of the first aspect, the total number of the flags “gt1_flag” may be limited to less than or equal to 8, or may be limited to an arbitrary number other than 16 or 8. Accordingly, in the second aspect, as compared to the second example of the first aspect (for example, the example illustrated in FIG. 65), it is possible to further reduce the coding amount of the flags. In addition, when the CABAC of variable symbol occurrence probability is used for encoding the gt1_flag and the gt2_flag, it is possible to reduce the processing load of the encoding of the flags. In other words, the CABAC of variable symbol occurrence probability involves a higher processing load than a processing load of the bypass processing of the CABAC. However, in the second aspect, it is possible to further reduce a total number of flags to which the CABAC of the variable symbol occurrence probability is applied. Accordingly, it is possible to further reduce the processing load than the second example of the first aspect.

[Third Aspect]

In the first aspect and the second aspect, a rice parameter is determined by the sum_minus1, and a remainder is encoded in the encoding method according to the rice parameter. More specifically, a rice parameter is determined by comparing the sum_minus1 and a threshold (for example, 12, 25, or the like).

According to the third aspect, in the same manner as the second aspect, a total number of each of the flags “gt1_flag” and the flags “gt2_flag” is limited, and the baseLevel is updated according to the total number of the flags used. In addition, according to the third aspect, the above-described threshold to be compared to the sum_minus1 for determining the rice parameter is changed according to the baseLevel.

FIG. 70 is a flowchart illustrating overall processing operations of entropy encoder 110 according to the third aspect. It should be noted that the flowchart illustrated in FIG. 70 includes Steps S430 instead of Step S230 of the flowchart illustrated in FIG. 60.

In the third aspect, as with the second example of the first aspect, a total number of each of the flags “gt1_flag” and the flags “gt2_flag” which are used in a sub-block is limited. For example, a total number of the flags “gt1_flag” is limited up to n_1, and a total number of the flags “gt2_flag” is limited up to n_2. For example, n_1 is an integer which satisfies 1≤n_1<16, and n_2 is an integer which satisfies 1≤n_2≤16.

For example, as illustrated in FIG. 70, entropy encoder 110 repeats the processes of Steps S210, S220, S430, and S140 for each of the sub-blocks such that each of the coefficients in the sub-block is encoded.

More specifically, entropy encoder 110 performs the processes of Steps S210 and S220 in the same manner as in the second example of the first aspect. In other words, first, entropy encoder 110 encodes, for each of the coefficients in the sub-block, the sig_flag of the coefficient, and encodes the parity_flag of the coefficient when the “sig_flag” is 1. In addition, entropy encoder 110, when the coefficient is a coefficient which is not 0 and is at or before the n_1th position, encodes the gt1_flag of the coefficient based on determination of whether the AbsLevel of the coefficient is greater than or equal to 3 (Step S210). Then, entropy encoder 110, for each of the coefficients in the sub-block, when the coefficient is a coefficient which has the AbsLevel greater than or equal to 3 and is at or before the n_2th position, encodes a gt2_flag of the coefficient based on determination of whether the AbsLevel of the coefficient is greater than or equal to 5 (Step S220).

Next, entropy encoder 110, for each of the coefficients in the sub-block, when the AbsLevel of the coefficient is greater than or equal to a baseLevel, encodes remainder=(AbsLevel−baseLevel)/2 of the coefficient (Step S430). At this time, according to the third aspect, entropy encoder 110 determines a rice parameter which varies according to the baseLevel, and encodes the above-described remainder using the encoding method according to the rice parameter.

Then, entropy encoder 110, for each of the coefficients in the sub-block, encodes a sign (plus or minus) of the coefficient when the coefficient is not 0 (Step S140).

Entropy encoder 110, subsequent to performing the processes of Steps S210, S220, S430, and S140 on the sub-block, performs the processes of Steps S210, S220, S430, and S140 in the same manner on the other sub-blocks.

FIG. 71 is a flowchart illustrating one example of the detailed processing operation of Step S430 illustrated in FIG. 70. It should be noted that the flowchart illustrated in FIG. 71 includes Steps S431 instead of Step S236 of the flowchart illustrated in FIG. 63.

First, entropy encoder 110 sets the baseLevel to 5 in the same manner as the second example of the first aspect (Step S231). Then, entropy encoder 110 repeats the processes of Steps S232 to S235 and S431 for each of the coefficients in the sub-block.

More specifically, entropy encoder 110 performs the processes of Steps S232 to S235 on current coefficient a in the same manner as in the second example of the first aspect.

Then, when it is determined that n_2 number of the flags “gt2_flag” have not been used for coefficients located prior to current coefficient a in scan order in the sub-block (No in Step S234), entropy encoder 110 encodes the remainder for coefficient a (Step S431). In addition, entropy encoder 110 also encodes the remainder for coefficient a after the processes of Steps S233 and S235 are performed (S236). More specifically, entropy encoder 110 encodes (AbsLevel−baseLevel)/2. It should be noted that the remainder is encoded when AbsLevel≥baseLevel is satisfied.

Entropy encoder 110, subsequent to performing the processes of Steps S232 to S235 and S431 on a coefficient included a sub-block, also performs the processes of Steps S232 to S235 and S431 in the same manner on the next coefficient included the sub-block. In this manner, the remainder is encoded as necessary for each of the coefficients included in the sub-block.

Here, in Step S431, when none of the processes of Steps S233 and S235 is performed, the baseLevel is 5. In addition, baseLevel is 1 when the process of Step S233 is performed, and baseLevel is 3 when the process of Step S235 is performed. According to the third aspect, entropy encoder 110 determines a different rice parameter according to the baseLevel, and encodes the above-described remainder using the encoding method according to the rice parameter. The encoding method according to the rice parameter is any one of three encoding methods illustrated in FIG. 50, for example.

Specifically, according to the third aspect, a threshold for determining a rice parameter is changed according to a value of the baseLevel.

Specifically, 12 and 25 are used as thresholds when baseLevel=5, in the same manner as in the first aspect and the second aspect. Accordingly, when sum_minus1<12, entropy encoder 110 determines the rice parameter to be g=0. In addition, when 12≤sum_minus1<25, entropy encoder 110 determines the rice parameter to be g=1. In addition, when 25≤sum_minus1, entropy encoder 110 determines the rice parameter to be g=2. Entropy encoder 110 selects an encoding method corresponding to the rice parameter determined in the above-described manner, and performs Golomb-Rice coding on a remainder, i.e., (AbsLevel−baseLevel)/2, using the selected encoding method.

In addition, when baseLevel=3, a thres_1 that is a value less than 12 and a thres_2 that is a value less than 25 are used as the thresholds. It should be noted that the thres_1 and the thres_2 satisfy the relationship of thres_1<thres_2. Accordingly, when sum_minus1<thres_1, entropy encoder 110 determines the rice parameter to be g=0. In addition, when thres_1≤sum_minus1<thres_2, entropy encoder 110 determines the rice parameter to be g=1. In addition, when thres_2≤sum_minus1, entropy encoder 110 determines the rice parameter to be g=2. Entropy encoder 110 selects an encoding method corresponding to the rice parameter determined in the above-described manner, and performs Golomb-Rice coding on a remainder, i.e., (AbsLevel−baseLevel)/2, using the selected encoding method.

In addition, when baseLevel=1, a thres_3 that is a value less than the thres_1 and a thres_4 that is a value less than the thres_2 are used as the thresholds. It should be noted that the thres_3 and the thres_4 satisfy the relationship of thres_3<thres_4. Accordingly, when sum_minus1<thres_3, entropy encoder 110 determines the rice parameter to be g=0. In addition, when thres_3≤sum_minus1<thres_4, entropy encoder 110 determines the rice parameter to be g=1. In addition, when thres_4≤sum_minus1, entropy encoder 110 determines the rice parameter to be g=2. Entropy encoder 110 selects an encoding method corresponding to the rice parameter determined in the above-described manner, and performs Golomb-Rice coding on a remainder, i.e., (AbsLevel−baseLevel)/2, using the selected encoding method.

As a more specific example, the above-described four thresholds are thres_1=2, thres_2=12, thres_3=1, and thres_4=2.

In such an example as described above, when baseLevel=3, the rice parameter is determined as below.

When sum_minus1<2, the rice parameter is determined to be g=0. This is because, when g=0, it is possible to make the code length of the remainder shortest. More specifically, when sum_minus1<2, the five surrounding coefficients which neighbor the current coefficient as illustrated in FIG. 51, for example, are each 1 or 2 in average. Accordingly, the current coefficient is predicted to be 3 or 4, and the remainder of the current coefficient is predicted to be 0. In this manner, as illustrated in FIG. 52, when the rice parameter is g=0, it is possible to make the code length of the remainder shortest.

When 2≤sum_minus1<12, the rice parameter is determined to be g=1. This is because, when g=1, it is possible to make the code length of the remainder shortest. More specifically, when 2≤sum_minus1<12, the five surrounding coefficients which neighbor the current coefficient as illustrated in FIG. 51, for example, are each 3 or 4 in average. Accordingly, the current coefficient is predicted to be 5 or 6, and the remainder of the current coefficient is predicted to be 1. In this manner, as illustrated in FIG. 52, when the rice parameter is g=1, it is possible to make the code length of the remainder shortest.

When 12≤sum_minus1, the rice parameter is determined to be g=2. This is because, when g=2, it is possible to make the code length of the remainder shortest. More specifically, when 12≤sum_minus1, the five surrounding coefficients which neighbor the current coefficient as illustrated in FIG. 51, for example, are each greater than or equal to 5 in average. Accordingly, the current coefficient is predicted to be greater than or equal to 7, and the remainder of the current coefficient is predicted to be greater than or equal to 2. In this manner, as illustrated in FIG. 52, when the rice parameter is g=2, it is possible to make the code length of the remainder shortest.

In addition, when baseLevel=1, the rice parameter is determined as below.

When sum_minus1=0, the rice parameter is determined to be g=0. This is because, when g=0, it is possible to make the code length of the remainder shortest. More specifically, when sum_minus1=0, the five surrounding coefficients which neighbor the current coefficient as illustrated in FIG. 51, for example, are each 0 or 1 in average. Accordingly, the current coefficient is predicted to be 1 or 2, and the remainder of the current coefficient is predicted to be 0. In this manner, as illustrated in FIG. 52, when the rice parameter is g=0, it is possible to make the code length of the remainder shortest.

When 1≤sum_minus1<2, the rice parameter is determined to be g=1. This is because, when g=1, it is possible to make the code length of the remainder shortest. More specifically, when 1≤sum_minus1<2, the five surrounding coefficients which neighbor the current coefficient as illustrated in FIG. 51, for example, are each 1 or 2 in average. Accordingly, the current coefficient is predicted to be 3 or 4, and the remainder of the current coefficient is predicted to be 1. In this manner, as illustrated in FIG. 52, when the rice parameter is g=1, it is possible to make the code length of the remainder shortest.

When 2≤sum_minus1, the rice parameter is determined to be g=2. This is because, when g=2, it is possible to make the code length of the remainder shortest. More specifically, when 2≤sum_minus1, the five surrounding coefficients which neighbor the current coefficient as illustrated in FIG. 51, for example, are each greater than or equal to 3 in average. Accordingly, the current coefficient is predicted to be greater than or equal to 5, and the remainder of the current coefficient is predicted to be greater than or equal to 2. In this manner, as illustrated in FIG. 52, when the rice parameter is g=2, it is possible to make the code length of the remainder shortest.

(Advantageous Effects of Third Aspect)

According to the third aspect, as compared with the second example of the first aspect, an appropriate rice parameter is determined, and thus there is a possibility that the coding amount of the remainder can be reduced. It should be noted that, although the rice parameter is switched according to the baseLevel in the third aspect, it is not necessary to limit the condition to the baseLevel, and the rice parameter may be switched whether or not the number of use of a flag (e.g., the gt1_flag or the gt2_flag) which is used in encoding a coefficient has reached the above-described maximum number. It should be noted that, when encoding a remainder, a method of binarizing the remainder may be switched by the baseLevel without using a rice parameter.

It should be noted that, although the threshold for determining a rice parameter is changed according to a value of the baseLevel in the third aspect, a rice parameter may be determined based on a difference between the baseLevel and a prediction value for an absolute value of a current coefficient without changing a threshold. In other words, in the third aspect, there is the case where, by changing a threshold according to a baseLevel, rice parameters which are mutually different rice parameters are determined for the same the numerical value (e.g., the same sum_minus1) that is compared to the threshold. However, mutually different rice parameters may be determined by changing, according to the baseLevel, a numerical value (e.g., the above-described difference) that is compared to the threshold, without changing the threshold. It is possible to yield an advantageous effect equivalent to the advantageous effect of the third aspect, in this case as well.

Summary of Embodiment 2

According to the present embodiment as described above, a flag is used in encoding a coefficient, and it is possible to appropriately limit a total number of the flags.

FIG. 72 is a flowchart illustrating processing operations performed by encoder 100 according to the present embodiment. It should be noted that the flowchart illustrated in FIG. 72 indicates the processing operations of the second example of the first aspect or the third aspect as described above.

Encoder 100 according to the present embodiment includes circuitry and memory connected to the circuitry, and the circuitry, in operation, performs the processes of Steps S10 and S20.

More specifically, the circuitry encodes, for each of a plurality of coefficients included in a structural unit of an image which has been transformed and quantized, an absolute value of the coefficient in predetermined order (Step S10). Next, the circuitry encodes, for each of the plurality of coefficients, a sign which indicates whether the coefficient is positive or negative (Step S20). Here, in encoding the absolute value (Step S10), the circuitry encodes a signal indicating parity that is the least significant bit of the absolute value (Step S11 a). Next, the circuitry determines whether to use a flag for encoding the absolute value other than the least significant bit, based on a first condition and a second condition (Step S12 a). Then, when it is determined that a flag is to be used, the circuitry encodes the flag by context-based adaptive binary arithmetic coding (CABAC) that involves updating a symbol occurrence probability (Step S13 a). The above-described first condition is a condition based on a magnitude of an absolute value, and the second condition is a condition for limiting the number of flags used in the structural unit. For example, the above-described signal indicating parity is a parity_flag.

In this manner, whether or not to use a flag is determined based on not only the first condition based on the magnitude of an absolute value of a coefficient, but also the second condition for limiting the number of flags, and thus it is possible to appropriately limit the number of flags.

It should be noted that when a flag is used, it is possible to reduce a coding amount of an absolute value of a coefficient. When a flag is not used, there is a possibility of an increase in a coding amount of an absolute value of a coefficient, or more specifically, a coding amount of a remainder for indicating an absolute value of a coefficient. In addition, there are cases where the CABAC in which an adaptive and variable symbol occurrence probability is applied in encoding a flag, and bypass processing of the CABAC, in which a fixed symbol occurrence probability is used, is applied in encoding the remainder. Here, in the CABAC in which the variable symbol occurrence probability is used, a processing load tends to be higher than the bypass processing. Accordingly, with the encoder according to one aspect of the present disclosure, the number of flags can be appropriately limited, and thus it is possible to reduce both of a coding amount of an absolute value and a processing load for encoding the absolute value.

In addition, in encoding an absolute value (Step S10), the circuitry may count the number of encoded flags every time a flag is encoded, and may determine that a flag is not to be used in encoding an absolute value other than the least significant bit when the second condition is not satisfied even when first condition is satisfied. Here, the second condition is a condition that a total number of counts corresponding to the number of flags which have been counted is less than a limit. The limit is, for example, the above-described maximum number, and a specific example thereof is the above-described n_1 or n_2.

For example, in the process of Step S211 in FIG. 61, the number of encoded flags “gt1_flag” is counted. Then, when the second condition that the total number of counts is less than a limit is satisfied, the processes of Steps S115 to S116 b are performed. On the other hand, when the second condition is not satisfied, the processes of Steps S115 to S116 b are not performed even when the condition of AbsLevel≠0 (i.e., the first condition) is satisfied. In other words, it is determined that the gt1_flag is not to be used in encoding an absolute value.

In addition, in the process of Step S221 in FIG. 62, the number of encoded flags “gt2_flag” is counted. Then, when the second condition that the total number of counts is less than the limit is satisfied, the processes of Steps S122 to S123 b are performed. On the other hand, when the second condition is not satisfied, the processes of Steps S122 to S123 b are not performed even when the condition of AbsLevel≥3 (i.e., the first condition) is satisfied. In other words, it is determined that the gt2_flag is not to be used in encoding an absolute value.

In this manner, every time a flag is encoded, the number of encoded flags is counted. Accordingly, it is possible to more appropriately limit the number of flags.

In addition, the first condition may be a condition that an absolute value is not the first value, or a condition that an absolute value is greater than or equal to the second value. For example, first value may be 0, and the second value may be 3.

With this, for a coefficient whose absolute value is not 0, for example, it is possible to appropriately limit the number of the flags (e.g., the gt1_flag) indicating whether the absolute value is greater than or equal to 3. Alternatively, for a coefficient whose absolute value is greater than or equal to 3, for example, it is possible to appropriately limit the number of flags (e.g., the gt2_flag) indicating whether or not the absolute value is greater than or equal to 5.

In addition, the flag may include mutually different types of flags.

With this, for example, it is possible to appropriately limit the number of different types of flags such as the above-described gt1_flag and gt2_flag. It should be noted that flags of different types may also include, for example, the sig_flag, the parity_flag, etc.

In addition, in encoding an absolute value (Step S10), the circuitry may derive a remainder including a numerical value for representing an absolute value when a flag cannot be used or when an absolute value cannot be represented by only at least one flag. Then, the circuitry may encode the derived remainder by the bypass processing of the CABAC.

In this manner, it is possible to appropriately encode an absolute value of a coefficient as a flag or as a data group including at least one flag and a remainder.

FIG. 73 is a flowchart illustrating encoding a remainder performed by encoder 100 according to the present embodiment. It should be noted that the flowchart illustrated in FIG. 73 illustrates the processing operations of the above-described third aspect.

In the above-described deriving of a remainder, the circuitry determines a base level (i.e., the above-described baseLevel) which indicates a numerical value which varies according to whether the total number of counts has reached a limit. The total number of counts corresponds to the total number of flags encoded for coefficients located prior to a coefficient corresponding to the remainder (Step S11 b). Next, the circuitry derives a remainder using the base level which has been determined (Step S12 b). In addition, the circuitry selects a binarizing method corresponding to the remainder, from among a plurality of binarizing methods which are different from one another, based on the base level used in deriving the remainder (Step S13 b). Next, the circuitry binarizes the remainder according to the binarizing method which has been selected (Step S14 b), and performs arithmetic coding on the remainder which has been binarized (Step S15 b).

For example, Step S11 b corresponds to the processes of Steps S231, S233, and S235 illustrated in FIG. 71. Accordingly, the base level determined when the total number of counts has reached the limit is 1 or 3, for example, and is less than the base level (e.g., 5) determined when the total number of counts is less than the limit. Furthermore, Steps S12 b to S15 b correspond to the processes of Step S431 illustrated in FIG. 71.

In this manner, it is possible to appropriately derive, using a base level, a remainder corresponding to an absolute value of a coefficient. In addition, since a binarizing method used in binarizing a remainder is selected based on the base level, it is possible to appropriately reduce the coding amount of the remainder.

FIG. 74 is a flowchart illustrating processing operations performed by decoder 200 according to the present embodiment. It should be noted that the flowchart illustrated in FIG. 74 indicates the processing operations of decoding corresponding to the encoding of the second example of the first aspect or the third aspect as described above.

Decoder 200 according to the present embodiment includes circuitry and memory connected to the circuitry, and the circuitry performs, in operation, the processes of Steps S30 and S40.

More specifically, the circuitry decodes, for each of a plurality of coefficients included in a structural unit of an image which has been encoded, an absolute value of the coefficient in predetermined order (Step S30). Next, the circuitry decodes, for each of the plurality of coefficients, a sign which indicates whether the coefficient is positive or negative (Step S40). Here, in the structural unit, among N (N is an integer greater than or equal to 2) coefficients each having an absolute value which satisfies a predetermined condition related to a magnitude, a flag is used in encoding the absolute value of each of M (M is an integer less than N) coefficients, and a flag is not used in encoding the absolute value of each of the remaining (N−M) coefficients. In addition, in decoding the absolute value (Step S30), the circuitry decodes a signal indicating parity that is the least significant bit of the absolute value (Step S31 a). Then, when a flag is used in encoding the absolute value other than the least significant bit, the circuitry decodes the flag by context-based adaptive binary arithmetic coding (CABAC) that involves updating a symbol occurrence probability (Step S32 a). For example, the above-described signal indicating parity is a parity_flag.

With this, even when the number of flags used in encoding a structural unit of an image is limited, it is possible to appropriately decode the encoded structural unit of the image.

In addition, the predetermined condition may be a condition that an absolute value of the coefficient is not the first value, or a condition that an absolute value of the coefficient is greater than or equal to the second value. For example, first value may be 0, and the second value may be 3.

With this, for a coefficient whose absolute value is not 0, for example, even when the number of flags (e.g., the gt1_flag) indicating whether the absolute value is greater than or equal to 3 is limited, it is possible to appropriately decode the encoded structural unit of the image. With this, for a coefficient whose absolute value is greater than or equal to 3, for example, even when the number of flags (e.g., the gt2_flag) indicating whether the absolute value is greater than or equal to 5 is limited, it is possible to appropriately decode the encoded structural unit of the image.

In addition, the flag may include mutually different types of flags

With this, for example, even when the number of each of the different types of flags such as the above-described gt1_flag and gt2_flag is limited, it is possible to appropriately decode the encoded structural unit of the image. It should be noted that flags of different types may also include, for example, the sig_flag, the parity_flag, etc.

In addition, in decoding the absolute value (Step S30), when a remainder including a numerical value for representing the absolute value is encoded, the circuitry may decode the remainder by the bypass processing of the CABAC.

In this manner, even when an absolute value of a coefficient is encoded as a flag or a data group including at least one flag and a remainder, it is possible to appropriately decode the encoded structural unit of the image.

FIG. 75 is a flowchart illustrating decoding a remainder performed by decoder 200 according to the present embodiment. It should be noted that the flowchart illustrated in FIG. 74 illustrates processing operations of decoding corresponding to encoding of the above-described third aspect.

In the above-described decoding of a remainder, first, the circuitry determines a base level (i.e., the above-described baseLevel) which indicates a numerical value which varies according to whether the total number of counts has reached a limit. The total number of counts corresponds to the total number of flags decoded for coefficients located prior to a coefficient corresponding to the remainder (Step S31 b). Next, the circuitry performs arithmetic decoding on the remainder into a binary signal (Step S32 b). Next, the circuitry selects a debinarizing method corresponding to the binary signal, from among mutually different debinarizing methods, based on the base level which has been determined (Step S33 b). Then, the circuitry debinarizes the binary signal according to the debinarizing method which has been selected (Step S34 b).

For example, Step S31 b corresponds to the processes of Steps S231, S233, and S235 illustrated in FIG. 71. Accordingly, the base level determined when the total number of counts has reached the limit is, for example, 1 or 3, and is less than the base level (e.g., 5) determined when the total number of counts is less than the limit.

In this manner, since a debinarizing method to be used in debinarizing a binary signal is selected based on a base level, it is possible to appropriately decode the remainder.

It should be noted that, although a sub-block is used as one example of a structural unit of an image according to the present embodiment, the structural unit is not limited to the sub-block, and the structural unit may be any unit. In addition, a block including 4×4 pixels included in a transform unit is used as a specific example of a sub-block according to the present embodiment. However, the sub-block is not limited to the specific example, and the sub-block may be any block.

In addition, according to the present embodiment, when an absolute value of each of the plurality of coefficients is sequentially encoded, the total number of flags which have already been encoded is counted, and when the total number of flags counted is less than a limit or maximum number, it is determined that a flag is to be used in encoding an absolute value of the next coefficient. However, the condition is not limited to the number of flags, and it may be determined that a flag is to be used when the total number of counts including the number of flags is less than a limit, and that a flag is not to be used when the total number of counts is not less than the limit. The total only needs to be a numerical value which takes a greater value as the number of flags which have already been encoded increases, and the total number of counts may include the number of other flags.

In addition, although the number of the flags “gt1_flag” and “gt2_flag” is limited according to the present embodiment, the definition of a flag whose total number is limited may be any definition. For example, although the gt1_flag is used for a coefficient whose absolute value is not 0 and indicates whether the absolute value is greater than or equal to 3, the gt1_flag may indicate whether the absolute value is greater than or equal to a numerical value other than 3. In addition, although the gt2_flag is used for a coefficient having an absolute value greater than or equal to 3 and indicates whether the absolute value is greater than or equal to 5, the g2_flag may be used for a coefficient having an absolute value greater than or equal to a numerical value other than 3 and indicate whether the absolute value is greater than or equal to a numerical value other than 5.

[Other Examples]

Encoder 100 and decoder 200 according to the above-described examples may be used as an image encoder and an image decoder, respectively, or as a video encoder and a video decoder, respectively.

Alternatively, encoder 100 and decoder 200 may be used as an entropy encoder and an entropy decoder, respectively. In other words, encoder 100 and decoder 200 may only correspond to entropy encoder 110 and entropy decoder 202. Other constituent elements may be included in another apparatus.

Furthermore, at least part of the above-described examples may be used as an encoding method, a decoding method, an entropy encoding method, an entropy decoding method, or other methods.

It should be noted that, each of the constituent elements may be configured in the form of an exclusive hardware product, or may be realized by executing a software program suitable for each of the constituent elements. Each of the constituent elements may be realized by means of a program executing unit, such as a CPU and a processor, reading and executing the software program recorded on a recording medium such as a hard disk or a semiconductor memory.

More specifically, each of encoder 100 and decoder 200 may include processing circuitry and storage which is electrically connected to the processing circuitry and accessible from the processing circuitry. For example, the processing circuitry corresponds to processor a1 or b1, and the storage corresponds to memory a2 or b2.

The processing circuitry includes at least one of the exclusive hardware and the program executing unit, and executes the processing using the storage. In addition, when the processing circuitry includes the program executing unit, the storage stores a software program that is executed by the program executing unit.

Here, the software for implementing encoder 100, decoder 200, or the like described above includes programs as indicated below.

For example, the program causes a computer to execute the encoding method below. The encoding method includes: encoding, for each of a plurality of coefficients, an absolute value of the coefficient in predetermined order, the plurality of coefficients being included in a structural unit of an image which has been transformed and quantized; and encoding, for each of the plurality of coefficients, a sign indicating whether the coefficient is positive or negative. In the encoding of the absolute value, a signal indicating parity that is a least significant bit of the absolute value is encoded, whether to use a flag in encoding a portion of the absolute value other than the least significant bit is determined based on a first condition and a second condition, and the flag is encoded by context-based adaptive binary arithmetic coding (CABAC) involving updating a symbol occurrence probability when it is determined that the flag is to be used, the first condition is based on a magnitude of the absolute value, and the second condition is for limiting a total number of flags used in the structural unit.

In addition, for example, the program causes a computer to execute the decoding method below. The decoding method includes: decoding, for each of a plurality of coefficients, an absolute value of the coefficient in predetermined order, the plurality of coefficients being included in a structural unit of an image which has been encoded; and decoding, for each of the plurality of coefficients, a sign indicating whether the coefficient is positive or negative. In the structural unit, among N coefficients each having an absolute value which satisfies a predetermined condition related to a magnitude, a flag is used in encoding an absolute value of each of M coefficients, and a flag is not used in encoding an absolute value of each of remaining (N−M) coefficients, N being an integer greater than or equal to 2, M being an integer less than N, in the decoding of the absolute value, a signal indicating parity that is a least significant bit of the absolute value is decoded, and when the flag is used in encoding a portion of the absolute value other than the least significant bit, the flag is decoded by context-based adaptive binary arithmetic coding (CABAC) involving updating a symbol occurrence probability.

In addition, each of the constituent elements may be circuitry as described above. The circuitries may be configured as a single circuitry as a whole or may be mutually different circuitries. In addition, each of the structural elements may be implemented as a general purpose processor or as a dedicated processor.

In addition, processes executed by a specific constituent element may be performed by a different constituent element. In addition, the order in which processes are performed may be changed, or a plurality of processes may be performed in parallel. In addition, an encoder/decoder may include encoder 100 and decoder 200.

In addition, the ordinal numbers such as first, second, etc., used for explanation may be arbitrarily replaced. In addition, an ordinal number may be newly added to a given one of the constituent elements, or the like, or the ordinal number of a given one of the constituent elements, or the like may be removed.

Aspects of encoder 100 and decoder 200 have been described above based on a plurality of examples. However, aspects of encoder 100 and decoder 200 are not limited to these examples. The one or more aspects of the present disclosure may encompass each of the examples obtainable by adding, to the embodiments, various kinds of modifications that a person skilled in the art would arrive at and embodiments configurable by combining constituent elements in different examples within the scope of the aspects of encoder 100 and decoder 200.

One or more of the aspects disclosed herein may be performed by combining at least part of the other aspects in the present disclosure. In addition, one or more of the aspects disclosed herein may be performed by combining, with other aspects, part of the processes indicated in any of the flow charts according to the aspects, part of the configuration of any of the devices, part of syntaxes, etc.

[Implementations and Applications]

As described in each of the above embodiments, each functional or operational block may typically be realized as an MPU (micro processing unit) and memory, for example. Moreover, processes performed by each of the functional blocks may be realized as a program execution unit, such as a processor which reads and executes software (a program) recorded on a recording medium such as ROM. The software may be distributed. The software may be recorded on a variety of recording media such as semiconductor memory. Note that each functional block can also be realized as hardware (dedicated circuit). Various combinations of hardware and software may be employed.

The processing described in each of the embodiments may be realized via integrated processing using a single apparatus (system), and, alternatively, may be realized via decentralized processing using a plurality of apparatuses. Moreover, the processor that executes the above-described program may be a single processor or a plurality of processors. In other words, integrated processing may be performed, and, alternatively, decentralized processing may be performed.

Embodiments of the present disclosure are not limited to the above exemplary embodiments; various modifications may be made to the exemplary embodiments, the results of which are also included within the scope of the embodiments of the present disclosure.

Next, application examples of the moving picture encoding method (image encoding method) and the moving picture decoding method (image decoding method) described in each of the above embodiments will be described, as well as various systems that implement the application examples. Such a system may be characterized as including an image encoder that employs the image encoding method, an image decoder that employs the image decoding method, or an image encoder-decoder that includes both the image encoder and the image decoder. Other configurations of such a system may be modified on a case-by-case basis.

[Usage Examples]

FIG. 76 illustrates an overall configuration of content providing system ex100 suitable for implementing a content distribution service. The area in which the communication service is provided is divided into cells of desired sizes, and base stations ex106, ex107, ex108, ex109, and ex110, which are fixed wireless stations in the illustrated example, are located in respective cells.

In content providing system ex100, devices including computer ex111, gaming device ex112, camera ex113, home appliance ex114, and smartphone ex115 are connected to internet ex101 via internet service provider ex102 or communications network ex104 and base stations ex106 through ex110. Content providing system ex100 may combine and connect any combination of the above devices. In various implementations, the devices may be directly or indirectly connected together via a telephone network or near field communication, rather than via base stations ex106 through ex110. Further, streaming server ex103 may be connected to devices including computer ex111, gaming device ex112, camera ex113, home appliance ex114, and smartphone ex115 via, for example, internet ex101. Streaming server ex103 may also be connected to, for example, a terminal in a hotspot in airplane ex117 via satellite ex116.

Note that instead of base stations ex106 through ex110, wireless access points or hotspots may be used. Streaming server ex103 may be connected to communications network ex104 directly instead of via internet ex101 or internet service provider ex102, and may be connected to airplane ex117 directly instead of via satellite ex116.

Camera ex113 is a device capable of capturing still images and video, such as a digital camera. Smartphone ex115 is a smartphone device, cellular phone, or personal handy-phone system (PHS) phone that can operate under the mobile communications system standards of the 2G, 3G, 3.9G, and 4G systems, as well as the next-generation 5G system.

Home appliance ex114 is, for example, a refrigerator or a device included in a home fuel cell cogeneration system.

In content providing system ex100, a terminal including an image and/or video capturing function is capable of, for example, live streaming by connecting to streaming server ex103 via, for example, base station ex106. When live streaming, a terminal (e.g., computer ex111, gaming device ex112, camera ex113, home appliance ex114, smartphone ex115, or a terminal in airplane ex117) may perform the encoding processing described in the above embodiments on still-image or video content captured by a user via the terminal, may multiplex video data obtained via the encoding and audio data obtained by encoding audio corresponding to the video, and may transmit the obtained data to streaming server ex103. In other words, the terminal functions as the image encoder according to one aspect of the present disclosure.

Streaming server ex103 streams transmitted content data to clients that request the stream. Client examples include computer ex111, gaming device ex112, camera ex113, home appliance ex114, smartphone ex115, and terminals inside airplane ex117, which are capable of decoding the above-described encoded data. Devices that receive the streamed data may decode and reproduce the received data. In other words, the devices may each function as the image decoder, according to one aspect of the present disclosure.

[Decentralized Processing]

Streaming server ex103 may be realized as a plurality of servers or computers between which tasks such as the processing, recording, and streaming of data are divided. For example, streaming server ex103 may be realized as a content delivery network (CDN) that streams content via a network connecting multiple edge servers located throughout the world. In a CDN, an edge server physically near the client may be dynamically assigned to the client. Content is cached and streamed to the edge server to reduce load times. In the event of, for example, some type of error or change in connectivity due, for example, to a spike in traffic, it is possible to stream data stably at high speeds, since it is possible to avoid affected parts of the network by, for example, dividing the processing between a plurality of edge servers, or switching the streaming duties to a different edge server and continuing streaming.

Decentralization is not limited to just the division of processing for streaming; the encoding of the captured data may be divided between and performed by the terminals, on the server side, or both. In one example, in typical encoding, the processing is performed in two loops. The first loop is for detecting how complicated the image is on a frame-by-frame or scene-by-scene basis, or detecting the encoding load. The second loop is for processing that maintains image quality and improves encoding efficiency. For example, it is possible to reduce the processing load of the terminals and improve the quality and encoding efficiency of the content by having the terminals perform the first loop of the encoding and having the server side that received the content perform the second loop of the encoding. In such a case, upon receipt of a decoding request, it is possible for the encoded data resulting from the first loop performed by one terminal to be received and reproduced on another terminal in approximately real time. This makes it possible to realize smooth, real-time streaming.

In another example, camera ex113 or the like extracts a feature amount (an amount of features or characteristics) from an image, compresses data related to the feature amount as metadata, and transmits the compressed metadata to a server. For example, the server determines the significance of an object based on the feature amount and changes the quantization accuracy accordingly to perform compression suitable for the meaning (or content significance) of the image. Feature amount data is particularly effective in improving the precision and efficiency of motion vector prediction during the second compression pass performed by the server. Moreover, encoding that has a relatively low processing load, such as variable length coding (VLC), may be handled by the terminal, and encoding that has a relatively high processing load, such as context-adaptive binary arithmetic coding (CABAC), may be handled by the server.

In yet another example, there are instances in which a plurality of videos of approximately the same scene are captured by a plurality of terminals in, for example, a stadium, shopping mall, or factory. In such a case, for example, the encoding may be decentralized by dividing processing tasks between the plurality of terminals that captured the videos and, if necessary, other terminals that did not capture the videos, and the server, on a per-unit basis. The units may be, for example, groups of pictures (GOP), pictures, or tiles resulting from dividing a picture. This makes it possible to reduce load times and achieve streaming that is closer to real time.

Since the videos are of approximately the same scene, management and/or instructions may be carried out by the server so that the videos captured by the terminals can be cross-referenced. Moreover, the server may receive encoded data from the terminals, change the reference relationship between items of data, or correct or replace pictures themselves, and then perform the encoding. This makes it possible to generate a stream with increased quality and efficiency for the individual items of data.

Furthermore, the server may stream video data after performing transcoding to convert the encoding format of the video data. For example, the server may convert the encoding format from MPEG to VP (e.g., VP9), may convert H.264 to H.265, etc.

In this way, encoding can be performed by a terminal or one or more servers. Accordingly, although the device that performs the encoding is referred to as a “server” or “terminal” in the following description, some or all of the processes performed by the server may be performed by the terminal, and likewise some or all of the processes performed by the terminal may be performed by the server. This also applies to decoding processes.

[3D, Multi-Angle]

There has been an increase in usage of images or videos combined from images or videos of different scenes concurrently captured, or of the same scene captured from different angles, by a plurality of terminals such as camera ex113 and/or smartphone ex115. Videos captured by the terminals may be combined based on, for example, the separately obtained relative positional relationship between the terminals, or regions in a video having matching feature points.

In addition to the encoding of two-dimensional moving pictures, the server may encode a still image based on scene analysis of a moving picture, either automatically or at a point in time specified by the user, and transmit the encoded still image to a reception terminal. Furthermore, when the server can obtain the relative positional relationship between the video capturing terminals, in addition to two-dimensional moving pictures, the server can generate three-dimensional geometry of a scene based on video of the same scene captured from different angles. The server may separately encode three-dimensional data generated from, for example, a point cloud and, based on a result of recognizing or tracking a person or object using three-dimensional data, may select or reconstruct and generate a video to be transmitted to a reception terminal, from videos captured by a plurality of terminals.

This allows the user to enjoy a scene by freely selecting videos corresponding to the video capturing terminals, and allows the user to enjoy the content obtained by extracting a video at a selected viewpoint from three-dimensional data reconstructed from a plurality of images or videos. Furthermore, as with video, sound may be recorded from relatively different angles, and the server may multiplex audio from a specific angle or space with the corresponding video, and transmit the multiplexed video and audio.

In recent years, content that is a composite of the real world and a virtual world, such as virtual reality (VR) and augmented reality (AR) content, has also become popular. In the case of VR images, the server may create images from the viewpoints of both the left and right eyes, and perform encoding that tolerates reference between the two viewpoint images, such as multi-view coding (MVC), and, alternatively, may encode the images as separate streams without referencing. When the images are decoded as separate streams, the streams may be synchronized when reproduced, so as to recreate a virtual three-dimensional space in accordance with the viewpoint of the user.

In the case of AR images, the server may superimpose virtual object information existing in a virtual space onto camera information representing a real-world space, based on a three-dimensional position or movement from the perspective of the user. The decoder may obtain or store virtual object information and three-dimensional data, generate two-dimensional images based on movement from the perspective of the user, and then generate superimposed data by seamlessly connecting the images. Alternatively, the decoder may transmit, to the server, motion from the perspective of the user in addition to a request for virtual object information. The server may generate superimposed data based on three-dimensional data stored in the server in accordance with the received motion, and encode and stream the generated superimposed data to the decoder. Note that superimposed data typically includes, in addition to RGB values, an a value indicating transparency, and the server sets the a value for sections other than the object generated from three-dimensional data to, for example, 0, and may perform the encoding while those sections are transparent. Alternatively, the server may set the background to a determined RGB value, such as a chroma key, and generate data in which areas other than the object are set as the background. The determined RGB value may be predetermined.

Decoding of similarly streamed data may be performed by the client (e.g., the terminals), on the server side, or divided therebetween. In one example, one terminal may transmit a reception request to a server, the requested content may be received and decoded by another terminal, and a decoded signal may be transmitted to a device having a display. It is possible to reproduce high image quality data by decentralizing processing and appropriately selecting content regardless of the processing ability of the communications terminal itself In yet another example, while a TV, for example, is receiving image data that is large in size, a region of a picture, such as a tile obtained by dividing the picture, may be decoded and displayed on a personal terminal or terminals of a viewer or viewers of the TV. This makes it possible for the viewers to share a big-picture view as well as for each viewer to check his or her assigned area, or inspect a region in further detail up close.

In situations in which a plurality of wireless connections are possible over near, mid, and far distances, indoors or outdoors, it may be possible to seamlessly receive content using a streaming system standard such as MPEG-DASH. The user may switch between data in real time while freely selecting a decoder or display apparatus including the user's terminal, displays arranged indoors or outdoors, etc. Moreover, using, for example, information on the position of the user, decoding can be performed while switching which terminal handles decoding and which terminal handles the displaying of content. This makes it possible to map and display information, while the user is on the move in route to a destination, on the wall of a nearby building in which a device capable of displaying content is embedded, or on part of the ground. Moreover, it is also possible to switch the bit rate of the received data based on the accessibility to the encoded data on a network, such as when encoded data is cached on a server quickly accessible from the reception terminal, or when encoded data is copied to an edge server in a content delivery service.

[Scalable Encoding]

The switching of content will be described with reference to a scalable stream, illustrated in FIG. 77, which is compression coded via implementation of the moving picture encoding method described in the above embodiments. The server may have a configuration in which content is switched while making use of the temporal and/or spatial scalability of a stream, which is achieved by division into and encoding of layers, as illustrated in FIG. 77. Note that there may be a plurality of individual streams that are of the same content but different quality. In other words, by determining which layer to decode based on internal factors, such as the processing ability on the decoder side, and external factors, such as communication bandwidth, the decoder side can freely switch between low resolution content and high resolution content while decoding. For example, in a case in which the user wants to continue watching, for example at home on a device such as a TV connected to the internet, a video that the user had been previously watching on smartphone ex115 while on the move, the device can simply decode the same stream up to a different layer, which reduces the server side load.

Furthermore, in addition to the configuration described above, in which scalability is achieved as a result of the pictures being encoded per layer, with the enhancement layer being above the base layer, the enhancement layer may include metadata based on, for example, statistical information on the image. The decoder side may generate high image quality content by performing super-resolution imaging on a picture in the base layer based on the metadata. Super-resolution imaging may improve the SN ratio while maintaining resolution and/or increasing resolution. Metadata includes information for identifying a linear or a non-linear filter coefficient, as used in super-resolution processing, or information identifying a parameter value in filter processing, machine learning, or a least squares method used in super-resolution processing.

Alternatively, a configuration may be provided in which a picture is divided into, for example, tiles in accordance with, for example, the meaning of an object in the image. On the decoder side, only a partial region is decoded by selecting a tile to decode. Further, by storing an attribute of the object (person, car, ball, etc.) and a position of the object in the video (coordinates in identical images) as metadata, the decoder side can identify the position of a desired object based on the metadata and determine which tile or tiles include that object. For example, as illustrated in FIG. 78, metadata may be stored using a data storage structure different from pixel data, such as an SEI (supplemental enhancement information) message in HEVC. This metadata indicates, for example, the position, size, or color of the main object.

Metadata may be stored in units of a plurality of pictures, such as stream, sequence, or random access units. The decoder side can obtain, for example, the time at which a specific person appears in the video, and by fitting the time information with picture unit information, can identify a picture in which the object is present, and can determine the position of the object in the picture.

[Web Page Optimization]

FIG. 79 illustrates an example of a display screen of a web page on computer ex111, for example. FIG. 80 illustrates an example of a display screen of a web page on smartphone ex115, for example. As illustrated in FIG. 79 and FIG. 80, a web page may include a plurality of image links that are links to image content, and the appearance of the web page may differ depending on the device used to view the web page. When a plurality of image links are viewable on the screen, until the user explicitly selects an image link, or until the image link is in the approximate center of the screen or the entire image link fits in the screen, the display apparatus (decoder) may display, as the image links, still images included in the content or I pictures; may display video such as an animated gif using a plurality of still images or I pictures; or may receive only the base layer, and decode and display the video.

When an image link is selected by the user, the display apparatus performs decoding while, for example, giving the highest priority to the base layer. Note that if there is information in the HTML code of the web page indicating that the content is scalable, the display apparatus may decode up to the enhancement layer. Further, in order to guarantee real-time reproduction, before a selection is made or when the bandwidth is severely limited, the display apparatus can reduce delay between the point in time at which the leading picture is decoded and the point in time at which the decoded picture is displayed (that is, the delay between the start of the decoding of the content to the displaying of the content) by decoding and displaying only forward reference pictures (I picture, P picture, forward reference B picture). Still further, the display apparatus may purposely ignore the reference relationship between pictures, and coarsely decode all B and P pictures as forward reference pictures, and then perform normal decoding as the number of pictures received over time increases.

[Autonomous Driving]

When transmitting and receiving still image or video data such as two- or three-dimensional map information for autonomous driving or assisted driving of an automobile, the reception terminal may receive, in addition to image data belonging to one or more layers, information on, for example, the weather or road construction as metadata, and associate the metadata with the image data upon decoding. Note that metadata may be assigned per layer and, alternatively, may simply be multiplexed with the image data.

In such a case, since the automobile, drone, airplane, etc., containing the reception terminal is mobile, the reception terminal may seamlessly receive and perform decoding while switching between base stations among base stations ex106 through ex110 by transmitting information indicating the position of the reception terminal. Moreover, in accordance with the selection made by the user, the situation of the user, and/or the bandwidth of the connection, the reception terminal may dynamically select to what extent the metadata is received, or to what extent the map information, for example, is updated.

In content providing system ex100, the client may receive, decode, and reproduce, in real time, encoded information transmitted by the user.

[Streaming of Individual Content]

In content providing system ex100, in addition to high image quality, long content distributed by a video distribution entity, unicast or multicast streaming of low image quality, and short content from an individual are also possible. Such content from individuals is likely to further increase in popularity. The server may first perform editing processing on the content before the encoding processing, in order to refine the individual content. This may be achieved using the following configuration, for example.

In real time while capturing video or image content, or after the content has been captured and accumulated, the server performs recognition processing based on the raw data or encoded data, such as capture error processing, scene search processing, meaning analysis, and/or object detection processing. Then, based on the result of the recognition processing, the server—either when prompted or automatically—edits the content, examples of which include: correction such as focus and/or motion blur correction; removing low-priority scenes such as scenes that are low in brightness compared to other pictures, or out of focus; object edge adjustment; and color tone adjustment. The server encodes the edited data based on the result of the editing. It is known that excessively long videos tend to receive fewer views. Accordingly, in order to keep the content within a specific length that scales with the length of the original video, the server may, in addition to the low-priority scenes described above, automatically clip out scenes with low movement, based on an image processing result. Alternatively, the server may generate and encode a video digest based on a result of an analysis of the meaning of a scene.

There may be instances in which individual content may include content that infringes a copyright, moral right, portrait rights, etc. Such instance may lead to an unfavorable situation for the creator, such as when content is shared beyond the scope intended by the creator. Accordingly, before encoding, the server may, for example, edit images so as to blur faces of people in the periphery of the screen or blur the inside of a house, for example. Further, the server may be configured to recognize the faces of people other than a registered person in images to be encoded, and when such faces appear in an image, may apply a mosaic filter, for example, to the face of the person. Alternatively, as pre- or post-processing for encoding, the user may specify, for copyright reasons, a region of an image including a person or a region of the background to be processed. The server may process the specified region by, for example, replacing the region with a different image, or blurring the region. If the region includes a person, the person may be tracked in the moving picture, and the person's head region may be replaced with another image as the person moves.

Since there is a demand for real-time viewing of content produced by individuals, which tends to be small in data size, the decoder may first receive the base layer as the highest priority, and perform decoding and reproduction, although this may differ depending on bandwidth. When the content is reproduced two or more times, such as when the decoder receives the enhancement layer during decoding and reproduction of the base layer, and loops the reproduction, the decoder may reproduce a high image quality video including the enhancement layer. If the stream is encoded using such scalable encoding, the video may be low quality when in an unselected state or at the start of the video, but it can offer an experience in which the image quality of the stream progressively increases in an intelligent manner. This is not limited to just scalable encoding; the same experience can be offered by configuring a single stream from a low quality stream reproduced for the first time and a second stream encoded using the first stream as a reference.

[Other Implementation and Application Examples]

The encoding and decoding may be performed by LSI (large scale integration circuitry) ex500 (see FIG. 76), which is typically included in each terminal. LSI ex500 may be configured of a single chip or a plurality of chips. Software for encoding and decoding moving pictures may be integrated into some type of a recording medium (such as a CD-ROM, a flexible disk, or a hard disk) that is readable by, for example, computer ex111, and the encoding and decoding may be performed using the software. Furthermore, when smartphone ex115 is equipped with a camera, the video data obtained by the camera may be transmitted. In this case, the video data may be coded by LSI ex500 included in smartphone ex115.

Note that LSI ex500 may be configured to download and activate an application. In such a case, the terminal first determines whether it is compatible with the scheme used to encode the content, or whether it is capable of executing a specific service. When the terminal is not compatible with the encoding scheme of the content, or when the terminal is not capable of executing a specific service, the terminal may first download a codec or application software and then obtain and reproduce the content.

Aside from the example of content providing system ex100 that uses internet ex101, at least the moving picture encoder (image encoder) or the moving picture decoder (image decoder) described in the above embodiments may be implemented in a digital broadcasting system. The same encoding processing and decoding processing may be applied to transmit and receive broadcast radio waves superimposed with multiplexed audio and video data using, for example, a satellite, even though this is geared toward multicast, whereas unicast is easier with content providing system ex100.

[Hardware Configuration]

FIG. 81 illustrates further details of smartphone ex115 shown in FIG. 76. FIG. 82 illustrates a configuration example of smartphone ex115. Smartphone ex115 includes antenna ex450 for transmitting and receiving radio waves to and from base station ex110, camera ex465 capable of capturing video and still images, and display ex458 that displays decoded data, such as video captured by camera ex465 and video received by antenna ex450. Smartphone ex115 further includes user interface ex466 such as a touch panel, audio output unit ex457 such as a speaker for outputting speech or other audio, audio input unit ex456 such as a microphone for audio input, memory ex467 capable of storing decoded data such as captured video or still images, recorded audio, received video or still images, and mail, as well as decoded data, and slot ex464 which is an interface for SIM ex468 for authorizing access to a network and various data. Note that external memory may be used instead of memory ex467.

Main controller ex460, which may comprehensively control display ex458 and user interface ex466, power supply circuit ex461, user interface input controller ex462, video signal processor ex455, camera interface ex463, display controller ex459, modulator/demodulator ex452, multiplexer/demultiplexer ex453, audio signal processor ex454, slot ex464, and memory ex467 are connected via bus ex470.

When the user turns on the power button of power supply circuit ex461, smartphone ex115 is powered on into an operable state, and each component is supplied with power from a battery pack.

Smartphone ex115 performs processing for, for example, calling and data transmission, based on control performed by main controller ex460, which includes a CPU, ROM, and RAM. When making calls, an audio signal recorded by audio input unit ex456 is converted into a digital audio signal by audio signal processor ex454, to which spread spectrum processing is applied by modulator/demodulator ex452 and digital-analog conversion, and frequency conversion processing is applied by transmitter/receiver ex451, and the resulting signal is transmitted via antenna ex450. The received data is amplified, frequency converted, and analog-digital converted, inverse spread spectrum processed by modulator/demodulator ex452, converted into an analog audio signal by audio signal processor ex454, and then output from audio output unit ex457. In data transmission mode, text, still-image, or video data may be transmitted under control of main controller ex460 via user interface input controller ex462 based on operation of user interface ex466 of the main body, for example. Similar transmission and reception processing is performed. In data transmission mode, when sending a video, still image, or video and audio, video signal processor ex455 compression encodes, via the moving picture encoding method described in the above embodiments, a video signal stored in memory ex467 or a video signal input from camera ex465, and transmits the encoded video data to multiplexer/demultiplexer ex453. Audio signal processor ex454 encodes an audio signal recorded by audio input unit ex456 while camera ex465 is capturing a video or still image, and transmits the encoded audio data to multiplexer/demultiplexer ex453. Multiplexer/demultiplexer ex453 multiplexes the encoded video data and encoded audio data using a determined scheme, modulates and converts the data using modulator/demodulator (modulator/demodulator circuit) ex452 and transmitter/receiver ex451, and transmits the result via antenna ex450. The determined scheme may be predetermined.

When video appended in an email or a chat, or a video linked from a web page, is received, for example, in order to decode the multiplexed data received via antenna ex450, multiplexer/demultiplexer ex453 demultiplexes the multiplexed data to divide the multiplexed data into a bitstream of video data and a bitstream of audio data, supplies the encoded video data to video signal processor ex455 via synchronous bus ex470, and supplies the encoded audio data to audio signal processor ex454 via synchronous bus ex470. Video signal processor ex455 decodes the video signal using a moving picture decoding method corresponding to the moving picture encoding method described in the above embodiments, and video or a still image included in the linked moving picture file is displayed on display ex458 via display controller ex459. Audio signal processor ex454 decodes the audio signal and outputs audio from audio output unit ex457. Since real-time streaming is becoming increasingly popular, there may be instances in which reproduction of the audio may be socially inappropriate, depending on the user's environment. Accordingly, as an initial value, a configuration in which only video data is reproduced, i.e., the audio signal is not reproduced, may be preferable; audio may be synchronized and reproduced only when an input, such as when the user clicks video data, is received.

Although smartphone ex115 was used in the above example, other implementations are conceivable: a transceiver terminal including both an encoder and a decoder; a transmitter terminal including only an encoder; and a receiver terminal including only a decoder. In the description of the digital broadcasting system, an example is given in which multiplexed data obtained as a result of video data being multiplexed with audio data is received or transmitted. The multiplexed data, however, may be video data multiplexed with data other than audio data, such as text data related to the video. Further, the video data itself rather than multiplexed data may be received or transmitted.

Although main controller ex460 including a CPU is described as controlling the encoding or decoding processes, various terminals often include GPUs. Accordingly, a configuration is acceptable in which a large area is processed at once by making use of the performance ability of the GPU via memory shared by the CPU and GPU, or memory including an address that is managed so as to allow common usage by the CPU and GPU. This makes it possible to shorten encoding time, maintain the real-time nature of the stream, and reduce delay. In particular, processing relating to motion estimation, deblocking filtering, sample adaptive offset (SAO), and transformation/quantization can be effectively carried out by the GPU instead of the CPU in units of pictures, for example, all at once.

INDUSTRIAL APPLICABILITY

The present disclosure is applicable to, for example, television receivers, digital video recorders, car navigation systems, mobile phones, digital cameras, digital video cameras, teleconference systems, electronic mirrors, etc.

The various embodiments described above can be combined to provide further embodiments. All of the U.S. patents, U.S. patent application publications, U.S. patent applications, foreign patents, foreign patent applications and non-patent publications referred to in this specification and/or listed in the Application Data Sheet are incorporated herein by reference, in their entirety. Aspects of the embodiments can be modified, if necessary to employ concepts of the various patents, applications and publications to provide yet further embodiments.

These and other changes can be made to the embodiments in light of the above-detailed description. In general, in the following claims, the terms used should not be construed to limit the claims to the specific embodiments disclosed in the specification and the claims, but should be construed to include all possible embodiments along with the full scope of equivalents to which such claims are entitled. Accordingly, the claims are not limited by the disclosure. 

1. An encoder comprising: memory; and a processor coupled to the memory and which, in operation, performs Context-Based Adaptive Binary Arithmetic Coding (CABAC), wherein in prediction residual coding of a current block, the processor, in operation, encodes a plurality of flags by CABAC, each of the plurality of flags relating to a coefficient included in the current block; determines a base level in a case where a number of encodable flags has not reached a limit; calculates a prediction absolute value of the coefficient based on a sum of absolute values of five neighboring coefficients of the coefficient in the current block, wherein the prediction absolute value of the coefficient corresponds to an average of the absolute values of the five neighboring coefficients; derives a rice parameter based on a difference between the prediction absolute value and the base level, wherein if the difference is below a first value, the rice parameter is set to zero, if the difference is equal to or larger than the first value and smaller than a second value, the rice parameter is set to one, and if the difference is equal to or larger than the second value, the rice parameter is set to two; encodes a remainder value of the coefficient using the derived rice parameter, wherein the remainder value is obtained by using an absolute value of the coefficient and the base level; and encodes a sign flag indicating whether the coefficient has a positive value or a negative value if the absolute value of the coefficient is more than zero.
 2. The encoder according to claim 1, wherein the plurality of flags includes: a first flag indicating whether the coefficient is zero or not; a second flag indicating whether the coefficient is an odd number or an even number; a third flag indicating whether an absolute value of the coefficient is equal to or larger than a first threshold value; and a fourth flag indicating whether the absolute value of the coefficient is equal to or larger than a second threshold value that is larger than the first threshold value.
 3. The encoder according to claim 1, wherein the five neighboring coefficients include: a first neighboring coefficient located next to a right side of the coefficient; a second neighboring coefficient located next to a right side of the first neighboring coefficient; a third neighboring coefficient located below the coefficient; a fourth neighboring coefficient located below the third neighboring coefficient; and a fifth neighboring coefficient located next to a right side of the third neighboring coefficient.
 4. The encoder according to claim 1, wherein the encoding of the plurality of flags and the encoding of the remainder value are repeated for each of a plurality of coefficients included in the current block until the number of encodable flags reach the limit.
 5. An encoding method, comprising: in prediction residual coding of a current block, encoding a plurality of flags by Context-Based Adaptive Binary Arithmetic Coding (CABAC), each of the plurality of flags relating to a coefficient included in the current block; determining a base level in a case where a number of encodable flags has not reached a limit; calculating a prediction absolute value of the coefficient based on a sum of absolute values of five neighboring coefficients in the current block, wherein the prediction absolute value of the coefficient corresponds to an average of the absolute values of the five neighboring coefficients; deriving a rice parameter based on a difference between the prediction absolute value and the base level, wherein if the difference is below a first value, the rice parameter is set to zero, if the difference is equal to or larger than the first value and smaller than a second value, the rice parameter is set to one, and if the difference is equal to or larger than the second value, the rice parameter is set to two; encoding a remainder value of the coefficient using the derived rice parameter, wherein the remainder value is obtained by using an absolute value of the coefficient and the base level; and encoding a sign flag indicating whether the coefficient has a positive value or a negative value if the absolute value of the coefficient is more than zero.
 6. The encoding method according to claim 5, wherein the plurality of flags include: a first flag indicating whether the coefficient is zero or not; a second flag indicating whether the coefficient is an odd number or an even number; a third flag indicating whether an absolute value of the coefficient is equal to or larger than a first threshold value; and a fourth flag indicating whether the absolute value of the coefficient is equal to or larger than a second threshold value that is larger than the first threshold value.
 7. The encoding method according to claim 5, wherein the five neighboring coefficients include: a first neighboring coefficient located next to a right side of the coefficient; a second neighboring coefficient located next to a right side of the first neighboring coefficient; a third neighboring coefficient located below the coefficient; a fourth neighboring coefficient located below the third neighboring coefficient; and a fifth neighboring coefficient located next to a right side of the third neighboring coefficient.
 8. The encoding method according to claim 5, wherein the encoding of the plurality of flags and the encoding of the remainder value are repeated for each of a plurality of coefficients included in the current block until the number of encodable flags reach the limit.
 9. A decoder comprising: memory; and a processor coupled to the memory and which, in operation, performs Context-Based Adaptive Binary Arithmetic Coding (CABAC) decoding, wherein in prediction residual decoding of a current block, the processor, in operation, decodes a plurality of flags by CABAC decoding, each of the plurality of flags relating to a coefficient included in the current block; determines a base level in a case where a number of decodable flags has not reached a limit; calculates a prediction absolute value of the coefficient based on a sum of absolute values of five neighboring coefficients of the coefficient in the current block, wherein the prediction absolute value of the coefficient corresponds to an average of the absolute values of the five neighboring coefficients; derives a rice parameter based on a difference between the prediction absolute value and the base level, wherein if the difference is below a first value, the rice parameter is set to zero, if the difference is equal to or larger than the first value and smaller than a second value, the rice parameter is set to one, and if the difference is equal to or larger than the second value, the rice parameter is set to two; decodes a remainder value of the coefficient using the derived rice parameter, wherein the remainder value is obtained by using an absolute value of the coefficient and the base level; and decodes a sign flag indicating whether the coefficient has a positive value or a negative value if the absolute value of the coefficient is more than zero.
 10. A decoding method, comprising: in prediction residual decoding of a current block, decoding a plurality of flags by Context-Based Adaptive Binary Arithmetic Coding (CABAC) decoding, each of the plurality of flags relating to a coefficient included in the current block; determining a base level in a case where a number of decodable flags has not reached a limit; calculating a prediction absolute value of the coefficient based on a sum of absolute values of five neighboring coefficients in the current block, wherein the prediction absolute value of the coefficient corresponds to an average of the absolute values of the five neighboring coefficients; deriving a rice parameter based on a difference between the prediction absolute value and the base level, wherein if the difference is below a first value, the rice parameter is set to zero, if the difference is equal to or larger than the first value and smaller than a second value, the rice parameter is set to one, and if the difference is equal to or larger than the second value, the rice parameter is set to two; decoding a remainder value of the coefficient using the derived rice parameter, wherein the remainder value and the base level are used to obtain an absolute value of the coefficient; and decoding a sign flag indicating whether the coefficient has a positive value or a negative value if the absolute value of the coefficient is more than zero.
 11. A non-transitory computer readable medium storing a bitstream for a decoder to perform prediction residual decoding of a current block, the bitstream comprising: a plurality of flags that are encoded by Context-Based Adaptive Binary Arithmetic Coding (CABAC), each of the plurality of flags relating to a coefficient included in the current block; and a remainder value of the coefficient that is encoded by using a rice parameter, wherein the remainder value and a base level are used to obtain an absolute value of the coefficient, the base level being a parameter determined in a case where a number of decodable flags has not reached a limit, wherein the rice parameter is derived based on a difference between a prediction absolute value and the base level, wherein the prediction absolute value of the coefficient is calculated based on a sum of absolute values of five neighboring coefficients in the current block, wherein the prediction absolute value of the coefficient corresponds to an average of the absolute values of the five neighboring coefficients, and wherein if the difference is below a first value, the rice parameter is set to zero, if the difference is equal to or larger than the first value and smaller than a second value, the rice parameter is set to one, and if the difference is equal to or larger than the second value, the rice parameter is set to two; and a sign flag indicating whether the coefficient has a positive value or a negative value if the absolute value of the coefficient is more than zero. 